./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2969d4725852fd68e7759cdb7f1d1929ca0124c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:54:05,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:54:05,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:54:05,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:54:05,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:54:05,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:54:05,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:54:05,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:54:05,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:54:05,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:54:05,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:54:05,137 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:54:05,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:54:05,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:54:05,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:54:05,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:54:05,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:54:05,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:54:05,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:54:05,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:54:05,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:54:05,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:54:05,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:54:05,170 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:54:05,170 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:54:05,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:54:05,172 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:54:05,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:54:05,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:54:05,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:54:05,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:54:05,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:54:05,183 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:54:05,183 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:54:05,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:54:05,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:54:05,188 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:54:05,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:54:05,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:54:05,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:54:05,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:54:05,216 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:54:05,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:54:05,216 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:54:05,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:54:05,217 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:54:05,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:54:05,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:54:05,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:54:05,218 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:54:05,218 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:54:05,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:54:05,219 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:54:05,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:54:05,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:54:05,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:54:05,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:54:05,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:54:05,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:54:05,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:54:05,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:54:05,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:54:05,223 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:54:05,223 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:54:05,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:54:05,224 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 -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2019-01-12 15:54:05,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:54:05,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:54:05,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:54:05,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:54:05,293 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:54:05,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2019-01-12 15:54:05,363 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e360cc53/d1cdd5bbb5574ef9885457cd3eb02e09/FLAG09635132a [2019-01-12 15:54:05,816 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:54:05,817 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2019-01-12 15:54:05,830 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e360cc53/d1cdd5bbb5574ef9885457cd3eb02e09/FLAG09635132a [2019-01-12 15:54:06,141 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e360cc53/d1cdd5bbb5574ef9885457cd3eb02e09 [2019-01-12 15:54:06,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:54:06,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:54:06,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:54:06,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:54:06,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:54:06,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d57bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06, skipping insertion in model container [2019-01-12 15:54:06,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:54:06,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:54:06,560 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:54:06,569 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:54:06,626 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:54:06,652 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:54:06,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06 WrapperNode [2019-01-12 15:54:06,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:54:06,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:54:06,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:54:06,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:54:06,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:54:06,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:54:06,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:54:06,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:54:06,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... [2019-01-12 15:54:06,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:54:06,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:54:06,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:54:06,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:54:06,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:54:06,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:54:06,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:54:07,768 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:54:07,768 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-12 15:54:07,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:54:07 BoogieIcfgContainer [2019-01-12 15:54:07,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:54:07,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:54:07,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:54:07,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:54:07,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:54:06" (1/3) ... [2019-01-12 15:54:07,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce50169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:54:07, skipping insertion in model container [2019-01-12 15:54:07,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:54:06" (2/3) ... [2019-01-12 15:54:07,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce50169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:54:07, skipping insertion in model container [2019-01-12 15:54:07,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:54:07" (3/3) ... [2019-01-12 15:54:07,779 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2019-01-12 15:54:07,789 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:54:07,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:54:07,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:54:07,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:54:07,844 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:54:07,844 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:54:07,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:54:07,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:54:07,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:54:07,845 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:54:07,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:54:07,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:54:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-12 15:54:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:54:07,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:07,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:07,872 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1524648029, now seen corresponding path program 1 times [2019-01-12 15:54:07,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:07,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:07,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:07,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:07,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:08,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:08,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:54:08,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:54:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:54:08,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:54:08,192 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2019-01-12 15:54:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:08,319 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2019-01-12 15:54:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:54:08,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-12 15:54:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:08,332 INFO L225 Difference]: With dead ends: 129 [2019-01-12 15:54:08,332 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 15:54:08,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:54:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 15:54:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-12 15:54:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 15:54:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2019-01-12 15:54:08,374 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 23 [2019-01-12 15:54:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:08,375 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2019-01-12 15:54:08,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:54:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-01-12 15:54:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:54:08,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:08,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:08,378 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1049597017, now seen corresponding path program 1 times [2019-01-12 15:54:08,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:08,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:08,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:08,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:08,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:08,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:08,512 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 3 states. [2019-01-12 15:54:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:08,593 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2019-01-12 15:54:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:08,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:54:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:08,596 INFO L225 Difference]: With dead ends: 156 [2019-01-12 15:54:08,597 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 15:54:08,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 15:54:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-01-12 15:54:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-12 15:54:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2019-01-12 15:54:08,613 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 39 [2019-01-12 15:54:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:08,614 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2019-01-12 15:54:08,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2019-01-12 15:54:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 15:54:08,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:08,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:08,616 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2018870194, now seen corresponding path program 1 times [2019-01-12 15:54:08,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:08,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:08,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:08,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:08,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:08,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:08,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:08,757 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand 3 states. [2019-01-12 15:54:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:08,819 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2019-01-12 15:54:08,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:08,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-12 15:54:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:08,823 INFO L225 Difference]: With dead ends: 249 [2019-01-12 15:54:08,824 INFO L226 Difference]: Without dead ends: 165 [2019-01-12 15:54:08,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-12 15:54:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-01-12 15:54:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-12 15:54:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-01-12 15:54:08,847 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 40 [2019-01-12 15:54:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:08,848 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-01-12 15:54:08,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-01-12 15:54:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 15:54:08,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:08,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:08,851 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1411558281, now seen corresponding path program 1 times [2019-01-12 15:54:08,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:08,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:08,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:08,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:09,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:09,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:54:09,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:54:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:54:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:54:09,070 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 5 states. [2019-01-12 15:54:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:09,384 INFO L93 Difference]: Finished difference Result 731 states and 1126 transitions. [2019-01-12 15:54:09,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:54:09,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-01-12 15:54:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:09,397 INFO L225 Difference]: With dead ends: 731 [2019-01-12 15:54:09,398 INFO L226 Difference]: Without dead ends: 589 [2019-01-12 15:54:09,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:54:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-01-12 15:54:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 303. [2019-01-12 15:54:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-01-12 15:54:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 454 transitions. [2019-01-12 15:54:09,461 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 454 transitions. Word has length 41 [2019-01-12 15:54:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:09,462 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 454 transitions. [2019-01-12 15:54:09,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:54:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 454 transitions. [2019-01-12 15:54:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-12 15:54:09,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:09,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:09,466 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash 425310312, now seen corresponding path program 1 times [2019-01-12 15:54:09,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:09,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:09,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:09,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:09,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:54:09,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:54:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:54:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:54:09,791 INFO L87 Difference]: Start difference. First operand 303 states and 454 transitions. Second operand 7 states. [2019-01-12 15:54:10,380 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 15:54:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:10,650 INFO L93 Difference]: Finished difference Result 617 states and 919 transitions. [2019-01-12 15:54:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:54:10,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-01-12 15:54:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:10,656 INFO L225 Difference]: With dead ends: 617 [2019-01-12 15:54:10,656 INFO L226 Difference]: Without dead ends: 615 [2019-01-12 15:54:10,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:54:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-01-12 15:54:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 327. [2019-01-12 15:54:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-01-12 15:54:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 478 transitions. [2019-01-12 15:54:10,690 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 478 transitions. Word has length 42 [2019-01-12 15:54:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:10,691 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 478 transitions. [2019-01-12 15:54:10,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:54:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 478 transitions. [2019-01-12 15:54:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 15:54:10,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:10,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:10,695 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash 352296257, now seen corresponding path program 1 times [2019-01-12 15:54:10,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:10,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:10,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:10,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:10,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:10,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:10,762 INFO L87 Difference]: Start difference. First operand 327 states and 478 transitions. Second operand 3 states. [2019-01-12 15:54:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:10,837 INFO L93 Difference]: Finished difference Result 879 states and 1292 transitions. [2019-01-12 15:54:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:10,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-12 15:54:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:10,845 INFO L225 Difference]: With dead ends: 879 [2019-01-12 15:54:10,846 INFO L226 Difference]: Without dead ends: 573 [2019-01-12 15:54:10,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-01-12 15:54:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2019-01-12 15:54:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-01-12 15:54:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 826 transitions. [2019-01-12 15:54:10,894 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 826 transitions. Word has length 43 [2019-01-12 15:54:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:10,894 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 826 transitions. [2019-01-12 15:54:10,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 826 transitions. [2019-01-12 15:54:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 15:54:10,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:10,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:10,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:10,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2025008167, now seen corresponding path program 1 times [2019-01-12 15:54:10,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:10,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:11,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:11,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:11,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:11,013 INFO L87 Difference]: Start difference. First operand 571 states and 826 transitions. Second operand 3 states. [2019-01-12 15:54:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:11,164 INFO L93 Difference]: Finished difference Result 1113 states and 1623 transitions. [2019-01-12 15:54:11,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:11,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-12 15:54:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:11,174 INFO L225 Difference]: With dead ends: 1113 [2019-01-12 15:54:11,175 INFO L226 Difference]: Without dead ends: 807 [2019-01-12 15:54:11,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-01-12 15:54:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 805. [2019-01-12 15:54:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-01-12 15:54:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1156 transitions. [2019-01-12 15:54:11,242 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1156 transitions. Word has length 43 [2019-01-12 15:54:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:11,242 INFO L480 AbstractCegarLoop]: Abstraction has 805 states and 1156 transitions. [2019-01-12 15:54:11,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1156 transitions. [2019-01-12 15:54:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 15:54:11,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:11,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:11,247 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2142126557, now seen corresponding path program 1 times [2019-01-12 15:54:11,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:11,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:11,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 15:54:11,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:11,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:54:11,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:54:11,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:54:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:54:11,436 INFO L87 Difference]: Start difference. First operand 805 states and 1156 transitions. Second operand 5 states. [2019-01-12 15:54:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:11,852 INFO L93 Difference]: Finished difference Result 2823 states and 4027 transitions. [2019-01-12 15:54:11,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:54:11,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-01-12 15:54:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:11,866 INFO L225 Difference]: With dead ends: 2823 [2019-01-12 15:54:11,866 INFO L226 Difference]: Without dead ends: 2041 [2019-01-12 15:54:11,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 15:54:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2019-01-12 15:54:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2037. [2019-01-12 15:54:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-01-12 15:54:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2868 transitions. [2019-01-12 15:54:12,053 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2868 transitions. Word has length 62 [2019-01-12 15:54:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:12,053 INFO L480 AbstractCegarLoop]: Abstraction has 2037 states and 2868 transitions. [2019-01-12 15:54:12,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:54:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2868 transitions. [2019-01-12 15:54:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:54:12,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:12,058 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:12,059 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932519, now seen corresponding path program 1 times [2019-01-12 15:54:12,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:12,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:12,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:12,441 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-12 15:54:12,593 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2019-01-12 15:54:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:54:12,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:54:12,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:54:12,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:12,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:54:13,039 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-12 15:54:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:54:13,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:54:13,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2019-01-12 15:54:13,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:54:13,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:54:13,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:54:13,273 INFO L87 Difference]: Start difference. First operand 2037 states and 2868 transitions. Second operand 7 states. [2019-01-12 15:54:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:14,160 INFO L93 Difference]: Finished difference Result 5052 states and 7158 transitions. [2019-01-12 15:54:14,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:54:14,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-01-12 15:54:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:14,178 INFO L225 Difference]: With dead ends: 5052 [2019-01-12 15:54:14,179 INFO L226 Difference]: Without dead ends: 3586 [2019-01-12 15:54:14,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:54:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2019-01-12 15:54:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3365. [2019-01-12 15:54:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3365 states. [2019-01-12 15:54:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4708 transitions. [2019-01-12 15:54:14,482 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4708 transitions. Word has length 63 [2019-01-12 15:54:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:14,483 INFO L480 AbstractCegarLoop]: Abstraction has 3365 states and 4708 transitions. [2019-01-12 15:54:14,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:54:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4708 transitions. [2019-01-12 15:54:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:54:14,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:14,489 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:14,489 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1752116912, now seen corresponding path program 1 times [2019-01-12 15:54:14,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:14,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:14,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:15,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:54:15,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:54:15,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:15,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:54:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:54:15,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-12 15:54:15,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:54:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:54:15,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:54:15,638 INFO L87 Difference]: Start difference. First operand 3365 states and 4708 transitions. Second operand 11 states. [2019-01-12 15:54:16,134 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 15:54:16,328 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 15:54:16,933 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 15:54:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:19,552 INFO L93 Difference]: Finished difference Result 11106 states and 15593 transitions. [2019-01-12 15:54:19,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:54:19,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-01-12 15:54:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:19,596 INFO L225 Difference]: With dead ends: 11106 [2019-01-12 15:54:19,596 INFO L226 Difference]: Without dead ends: 8752 [2019-01-12 15:54:19,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:54:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2019-01-12 15:54:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 4615. [2019-01-12 15:54:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4615 states. [2019-01-12 15:54:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6480 transitions. [2019-01-12 15:54:20,046 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6480 transitions. Word has length 64 [2019-01-12 15:54:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:20,046 INFO L480 AbstractCegarLoop]: Abstraction has 4615 states and 6480 transitions. [2019-01-12 15:54:20,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:54:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6480 transitions. [2019-01-12 15:54:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:54:20,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:20,051 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:20,051 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:20,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:20,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1324770848, now seen corresponding path program 1 times [2019-01-12 15:54:20,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:20,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:20,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:20,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:20,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:20,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:20,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:20,145 INFO L87 Difference]: Start difference. First operand 4615 states and 6480 transitions. Second operand 3 states. [2019-01-12 15:54:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:20,537 INFO L93 Difference]: Finished difference Result 7507 states and 10507 transitions. [2019-01-12 15:54:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:20,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-12 15:54:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:20,561 INFO L225 Difference]: With dead ends: 7507 [2019-01-12 15:54:20,563 INFO L226 Difference]: Without dead ends: 4880 [2019-01-12 15:54:20,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2019-01-12 15:54:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4683. [2019-01-12 15:54:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4683 states. [2019-01-12 15:54:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 6431 transitions. [2019-01-12 15:54:20,960 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 6431 transitions. Word has length 64 [2019-01-12 15:54:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:20,960 INFO L480 AbstractCegarLoop]: Abstraction has 4683 states and 6431 transitions. [2019-01-12 15:54:20,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6431 transitions. [2019-01-12 15:54:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:54:20,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:20,964 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:20,964 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash -693070170, now seen corresponding path program 1 times [2019-01-12 15:54:20,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:20,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:20,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:21,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:21,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:21,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:21,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:21,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:21,061 INFO L87 Difference]: Start difference. First operand 4683 states and 6431 transitions. Second operand 3 states. [2019-01-12 15:54:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:21,343 INFO L93 Difference]: Finished difference Result 9747 states and 13357 transitions. [2019-01-12 15:54:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:21,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-12 15:54:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:21,370 INFO L225 Difference]: With dead ends: 9747 [2019-01-12 15:54:21,370 INFO L226 Difference]: Without dead ends: 6169 [2019-01-12 15:54:21,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-01-12 15:54:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6129. [2019-01-12 15:54:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-01-12 15:54:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 8308 transitions. [2019-01-12 15:54:21,767 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 8308 transitions. Word has length 64 [2019-01-12 15:54:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:21,768 INFO L480 AbstractCegarLoop]: Abstraction has 6129 states and 8308 transitions. [2019-01-12 15:54:21,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 8308 transitions. [2019-01-12 15:54:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:54:21,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:21,772 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:21,772 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 809095304, now seen corresponding path program 1 times [2019-01-12 15:54:21,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:21,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:21,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:54:21,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:22,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:54:22,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:54:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:54:22,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:54:22,001 INFO L87 Difference]: Start difference. First operand 6129 states and 8308 transitions. Second operand 6 states. [2019-01-12 15:54:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:23,220 INFO L93 Difference]: Finished difference Result 15825 states and 21360 transitions. [2019-01-12 15:54:23,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:54:23,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-12 15:54:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:23,238 INFO L225 Difference]: With dead ends: 15825 [2019-01-12 15:54:23,238 INFO L226 Difference]: Without dead ends: 9749 [2019-01-12 15:54:23,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:54:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2019-01-12 15:54:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9535. [2019-01-12 15:54:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9535 states. [2019-01-12 15:54:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9535 states to 9535 states and 12798 transitions. [2019-01-12 15:54:23,668 INFO L78 Accepts]: Start accepts. Automaton has 9535 states and 12798 transitions. Word has length 64 [2019-01-12 15:54:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:23,669 INFO L480 AbstractCegarLoop]: Abstraction has 9535 states and 12798 transitions. [2019-01-12 15:54:23,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:54:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9535 states and 12798 transitions. [2019-01-12 15:54:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:54:23,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:23,672 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:23,672 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash 107495430, now seen corresponding path program 1 times [2019-01-12 15:54:23,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:23,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:23,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:23,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:54:23,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:54:23,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:24,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:54:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:24,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:54:24,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-12 15:54:24,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:54:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:54:24,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:54:24,177 INFO L87 Difference]: Start difference. First operand 9535 states and 12798 transitions. Second operand 11 states. [2019-01-12 15:54:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:25,284 INFO L93 Difference]: Finished difference Result 22389 states and 30243 transitions. [2019-01-12 15:54:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:54:25,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-01-12 15:54:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:25,322 INFO L225 Difference]: With dead ends: 22389 [2019-01-12 15:54:25,322 INFO L226 Difference]: Without dead ends: 19815 [2019-01-12 15:54:25,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:54:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19815 states. [2019-01-12 15:54:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19815 to 10727. [2019-01-12 15:54:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10727 states. [2019-01-12 15:54:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10727 states to 10727 states and 14421 transitions. [2019-01-12 15:54:26,212 INFO L78 Accepts]: Start accepts. Automaton has 10727 states and 14421 transitions. Word has length 64 [2019-01-12 15:54:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:26,212 INFO L480 AbstractCegarLoop]: Abstraction has 10727 states and 14421 transitions. [2019-01-12 15:54:26,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:54:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10727 states and 14421 transitions. [2019-01-12 15:54:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 15:54:26,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:26,218 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:26,218 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:26,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1571663051, now seen corresponding path program 1 times [2019-01-12 15:54:26,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:26,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:26,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:26,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:26,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:26,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:26,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:26,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:26,301 INFO L87 Difference]: Start difference. First operand 10727 states and 14421 transitions. Second operand 3 states. [2019-01-12 15:54:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:27,136 INFO L93 Difference]: Finished difference Result 13460 states and 17861 transitions. [2019-01-12 15:54:27,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:27,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-12 15:54:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:27,151 INFO L225 Difference]: With dead ends: 13460 [2019-01-12 15:54:27,151 INFO L226 Difference]: Without dead ends: 9173 [2019-01-12 15:54:27,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9173 states. [2019-01-12 15:54:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9173 to 9155. [2019-01-12 15:54:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9155 states. [2019-01-12 15:54:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9155 states to 9155 states and 11985 transitions. [2019-01-12 15:54:27,940 INFO L78 Accepts]: Start accepts. Automaton has 9155 states and 11985 transitions. Word has length 65 [2019-01-12 15:54:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:27,941 INFO L480 AbstractCegarLoop]: Abstraction has 9155 states and 11985 transitions. [2019-01-12 15:54:27,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 9155 states and 11985 transitions. [2019-01-12 15:54:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 15:54:27,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:27,944 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:27,944 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1664257503, now seen corresponding path program 1 times [2019-01-12 15:54:27,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:27,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:27,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:28,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:54:28,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:54:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:28,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:54:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:54:28,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-12 15:54:28,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:54:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:54:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:54:28,388 INFO L87 Difference]: Start difference. First operand 9155 states and 11985 transitions. Second operand 11 states. [2019-01-12 15:54:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:29,319 INFO L93 Difference]: Finished difference Result 18660 states and 24234 transitions. [2019-01-12 15:54:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:54:29,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-01-12 15:54:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:29,333 INFO L225 Difference]: With dead ends: 18660 [2019-01-12 15:54:29,333 INFO L226 Difference]: Without dead ends: 13612 [2019-01-12 15:54:29,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:54:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13612 states. [2019-01-12 15:54:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13612 to 9445. [2019-01-12 15:54:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-01-12 15:54:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 12263 transitions. [2019-01-12 15:54:29,993 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 12263 transitions. Word has length 65 [2019-01-12 15:54:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 12263 transitions. [2019-01-12 15:54:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:54:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 12263 transitions. [2019-01-12 15:54:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 15:54:29,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:29,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:29,997 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:29,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1283872475, now seen corresponding path program 1 times [2019-01-12 15:54:29,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:29,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:29,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:30,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:54:30,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:54:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:54:30,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:54:30,084 INFO L87 Difference]: Start difference. First operand 9445 states and 12263 transitions. Second operand 3 states. [2019-01-12 15:54:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:30,774 INFO L93 Difference]: Finished difference Result 17877 states and 23264 transitions. [2019-01-12 15:54:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:54:30,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-12 15:54:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:30,786 INFO L225 Difference]: With dead ends: 17877 [2019-01-12 15:54:30,786 INFO L226 Difference]: Without dead ends: 11695 [2019-01-12 15:54:30,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:54:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2019-01-12 15:54:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 11469. [2019-01-12 15:54:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11469 states. [2019-01-12 15:54:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 14643 transitions. [2019-01-12 15:54:31,701 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 14643 transitions. Word has length 65 [2019-01-12 15:54:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:31,701 INFO L480 AbstractCegarLoop]: Abstraction has 11469 states and 14643 transitions. [2019-01-12 15:54:31,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:54:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 14643 transitions. [2019-01-12 15:54:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 15:54:31,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:31,705 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:31,706 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash 815203644, now seen corresponding path program 1 times [2019-01-12 15:54:31,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:31,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:31,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:31,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:54:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:31,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:54:31,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:54:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:54:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:54:31,832 INFO L87 Difference]: Start difference. First operand 11469 states and 14643 transitions. Second operand 5 states. [2019-01-12 15:54:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:32,695 INFO L93 Difference]: Finished difference Result 17982 states and 23210 transitions. [2019-01-12 15:54:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:54:32,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-01-12 15:54:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:32,714 INFO L225 Difference]: With dead ends: 17982 [2019-01-12 15:54:32,714 INFO L226 Difference]: Without dead ends: 15048 [2019-01-12 15:54:32,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:54:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15048 states. [2019-01-12 15:54:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15048 to 12838. [2019-01-12 15:54:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12838 states. [2019-01-12 15:54:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12838 states to 12838 states and 16362 transitions. [2019-01-12 15:54:34,409 INFO L78 Accepts]: Start accepts. Automaton has 12838 states and 16362 transitions. Word has length 65 [2019-01-12 15:54:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:34,409 INFO L480 AbstractCegarLoop]: Abstraction has 12838 states and 16362 transitions. [2019-01-12 15:54:34,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:54:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 12838 states and 16362 transitions. [2019-01-12 15:54:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 15:54:34,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:34,417 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:34,418 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:34,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash 352986821, now seen corresponding path program 1 times [2019-01-12 15:54:34,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:34,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:34,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:34,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:34,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:54:34,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:34,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:54:34,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:54:34,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:54:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:54:34,722 INFO L87 Difference]: Start difference. First operand 12838 states and 16362 transitions. Second operand 5 states. [2019-01-12 15:54:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:35,769 INFO L93 Difference]: Finished difference Result 19312 states and 24919 transitions. [2019-01-12 15:54:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:54:35,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-12 15:54:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:35,786 INFO L225 Difference]: With dead ends: 19312 [2019-01-12 15:54:35,786 INFO L226 Difference]: Without dead ends: 16403 [2019-01-12 15:54:35,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:54:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2019-01-12 15:54:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 15212. [2019-01-12 15:54:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15212 states. [2019-01-12 15:54:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15212 states to 15212 states and 19402 transitions. [2019-01-12 15:54:37,078 INFO L78 Accepts]: Start accepts. Automaton has 15212 states and 19402 transitions. Word has length 66 [2019-01-12 15:54:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:37,078 INFO L480 AbstractCegarLoop]: Abstraction has 15212 states and 19402 transitions. [2019-01-12 15:54:37,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:54:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 15212 states and 19402 transitions. [2019-01-12 15:54:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 15:54:37,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:37,082 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:37,082 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1404868071, now seen corresponding path program 1 times [2019-01-12 15:54:37,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:37,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:37,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:54:37,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:54:37,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:54:37,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:54:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:54:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:54:37,389 INFO L87 Difference]: Start difference. First operand 15212 states and 19402 transitions. Second operand 5 states. [2019-01-12 15:54:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:54:38,877 INFO L93 Difference]: Finished difference Result 21150 states and 27244 transitions. [2019-01-12 15:54:38,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:54:38,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-12 15:54:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:54:38,898 INFO L225 Difference]: With dead ends: 21150 [2019-01-12 15:54:38,898 INFO L226 Difference]: Without dead ends: 18424 [2019-01-12 15:54:38,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:54:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18424 states. [2019-01-12 15:54:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18424 to 17222. [2019-01-12 15:54:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17222 states. [2019-01-12 15:54:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17222 states to 17222 states and 21948 transitions. [2019-01-12 15:54:40,242 INFO L78 Accepts]: Start accepts. Automaton has 17222 states and 21948 transitions. Word has length 66 [2019-01-12 15:54:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:54:40,243 INFO L480 AbstractCegarLoop]: Abstraction has 17222 states and 21948 transitions. [2019-01-12 15:54:40,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:54:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17222 states and 21948 transitions. [2019-01-12 15:54:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 15:54:40,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:54:40,247 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:54:40,247 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:54:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:54:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1470846148, now seen corresponding path program 1 times [2019-01-12 15:54:40,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:54:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:54:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:40,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:54:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:40,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:54:40,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:54:40,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:54:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:54:40,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:54:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:54:41,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:54:41,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-01-12 15:54:41,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 15:54:41,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 15:54:41,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-01-12 15:54:41,829 INFO L87 Difference]: Start difference. First operand 17222 states and 21948 transitions. Second operand 23 states. [2019-01-12 15:54:42,028 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-01-12 15:54:42,536 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-01-12 15:54:42,780 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-01-12 15:54:42,970 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-01-12 15:54:43,128 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-01-12 15:54:43,366 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-01-12 15:54:43,550 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-12 15:54:43,692 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-12 15:54:43,917 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-01-12 15:54:44,177 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-01-12 15:54:44,395 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-01-12 15:54:44,684 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-01-12 15:54:45,007 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-01-12 15:54:45,357 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-01-12 15:54:45,491 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-12 15:54:45,852 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-01-12 15:54:46,061 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-01-12 15:54:46,200 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-01-12 15:54:46,388 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-01-12 15:54:46,571 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-01-12 15:54:46,833 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-01-12 15:54:47,244 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-12 15:54:47,398 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-12 15:54:47,559 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-01-12 15:54:48,266 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-01-12 15:54:48,550 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-01-12 15:54:48,751 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-01-12 15:54:48,917 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-12 15:54:49,212 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-01-12 15:54:49,492 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-01-12 15:54:49,804 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-01-12 15:54:50,073 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-01-12 15:54:50,385 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-01-12 15:54:50,747 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-01-12 15:54:50,963 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-01-12 15:54:51,120 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 15:54:51,334 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-12 15:54:51,672 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-01-12 15:54:51,874 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-12 15:54:52,247 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-01-12 15:54:52,494 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-01-12 15:54:52,727 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-01-12 15:54:52,947 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-12 15:54:53,117 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-01-12 15:54:53,290 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-12 15:54:53,575 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-01-12 15:54:54,162 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-01-12 15:54:54,320 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-01-12 15:54:54,577 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-01-12 15:54:54,822 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-12 15:54:54,993 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-01-12 15:54:55,218 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-12 15:54:55,781 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-01-12 15:54:56,064 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-01-12 15:54:56,243 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-01-12 15:54:56,523 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-01-12 15:54:56,801 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-01-12 15:54:57,008 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-01-12 15:54:57,180 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-12 15:54:57,398 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-01-12 15:54:57,576 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-01-12 15:54:58,079 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 15:54:58,440 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-12 15:54:58,737 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-01-12 15:54:58,942 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-01-12 15:54:59,079 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 15:54:59,325 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-01-12 15:54:59,512 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 15:55:00,164 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-12 15:55:00,351 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-12 15:55:00,563 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-01-12 15:55:00,911 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-01-12 15:55:01,259 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-01-12 15:55:01,467 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-01-12 15:55:01,617 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-01-12 15:55:02,019 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-01-12 15:55:02,296 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-12 15:55:02,548 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-12 15:55:02,765 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-01-12 15:55:03,001 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-12 15:55:03,210 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-01-12 15:55:03,609 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-01-12 15:55:03,983 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-01-12 15:55:04,326 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-01-12 15:55:04,525 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-01-12 15:55:05,193 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-12 15:55:05,390 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-01-12 15:55:06,005 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-01-12 15:55:06,291 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-01-12 15:55:06,538 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-01-12 15:55:06,903 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-01-12 15:55:07,131 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-01-12 15:55:07,297 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-01-12 15:55:07,497 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-12 15:55:07,892 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-01-12 15:55:08,357 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-01-12 15:55:08,877 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-01-12 15:55:09,173 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-01-12 15:55:09,933 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-01-12 15:55:10,203 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-01-12 15:55:10,484 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-01-12 15:55:10,772 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-01-12 15:55:10,976 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-12 15:55:11,314 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-01-12 15:55:11,552 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-01-12 15:55:11,812 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-12 15:55:12,170 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-01-12 15:55:12,303 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-12 15:55:13,100 WARN L181 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-12 15:55:13,503 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-12 15:55:13,945 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-12 15:55:14,948 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-01-12 15:55:15,527 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-01-12 15:55:15,924 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-01-12 15:55:16,149 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-12 15:55:16,371 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-01-12 15:55:16,561 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-12 15:55:17,223 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-01-12 15:55:17,551 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-01-12 15:55:17,815 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-01-12 15:55:18,096 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-01-12 15:55:18,328 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-12 15:55:18,562 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-01-12 15:55:18,724 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-01-12 15:55:18,858 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-01-12 15:55:19,068 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-12 15:55:19,605 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-01-12 15:55:20,136 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-01-12 15:55:20,453 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-01-12 15:55:20,772 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-12 15:55:21,031 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-01-12 15:55:21,373 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-01-12 15:55:21,597 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-01-12 15:55:21,733 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 15:55:22,014 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-01-12 15:55:22,335 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-01-12 15:55:22,482 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-01-12 15:55:22,676 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-12 15:55:23,031 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-01-12 15:55:23,405 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-01-12 15:55:23,693 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-01-12 15:55:23,876 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-12 15:55:24,079 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-01-12 15:55:24,500 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-01-12 15:55:24,841 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-01-12 15:55:25,131 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-12 15:55:25,381 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-12 15:55:25,675 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-12 15:55:25,946 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-01-12 15:55:26,097 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-12 15:55:26,299 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-01-12 15:55:26,553 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-01-12 15:55:26,719 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-12 15:55:27,009 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-12 15:55:27,176 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-01-12 15:55:27,430 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-12 15:55:27,843 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-01-12 15:55:28,060 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-01-12 15:55:28,216 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-01-12 15:55:28,342 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-01-12 15:55:28,479 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-01-12 15:55:28,798 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-01-12 15:55:28,989 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-12 15:55:29,245 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-12 15:55:29,447 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-12 15:55:29,637 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 15:55:30,056 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-01-12 15:55:30,370 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-12 15:55:30,651 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-01-12 15:55:31,013 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-01-12 15:55:31,206 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-12 15:55:31,347 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-01-12 15:55:31,815 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-12 15:55:32,329 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-01-12 15:55:32,578 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-01-12 15:55:32,821 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-01-12 15:55:33,092 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-01-12 15:55:33,541 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-12 15:55:33,692 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-01-12 15:55:33,822 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-01-12 15:55:34,041 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-01-12 15:55:34,245 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-01-12 15:55:34,486 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-01-12 15:55:34,742 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-01-12 15:55:35,019 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-01-12 15:55:35,389 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-01-12 15:55:35,615 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-12 15:55:36,078 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-01-12 15:55:36,302 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-12 15:55:36,460 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-12 15:55:36,834 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-01-12 15:55:37,050 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-12 15:55:37,201 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-12 15:55:37,621 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-01-12 15:55:37,950 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-12 15:55:38,160 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-01-12 15:55:38,535 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-12 15:55:38,912 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-01-12 15:55:39,583 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-01-12 15:55:39,846 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-01-12 15:55:40,048 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-12 15:55:40,370 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-01-12 15:55:40,599 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-01-12 15:55:40,780 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-01-12 15:55:41,227 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-12 15:55:42,169 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-01-12 15:55:42,343 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-12 15:55:42,556 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-01-12 15:55:42,733 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-01-12 15:55:42,893 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 15:55:43,589 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-01-12 15:55:43,732 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-01-12 15:55:43,902 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-01-12 15:55:44,109 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-12 15:55:44,476 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-12 15:55:44,867 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-01-12 15:55:45,223 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-01-12 15:55:45,518 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-01-12 15:55:45,679 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-01-12 15:55:45,883 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-01-12 15:55:46,052 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-01-12 15:55:46,245 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-12 15:55:46,432 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-12 15:55:46,617 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-01-12 15:55:47,031 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-01-12 15:55:47,387 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-12 15:55:47,556 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-12 15:55:47,760 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-12 15:55:48,838 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-01-12 15:55:49,032 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-01-12 15:55:49,181 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-01-12 15:55:49,690 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 15:55:50,473 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-01-12 15:55:51,023 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-12 15:55:51,399 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-12 15:55:51,612 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-12 15:55:52,011 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-01-12 15:55:52,306 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-01-12 15:55:52,497 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-12 15:55:52,657 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 15:55:52,802 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-12 15:55:53,361 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-01-12 15:55:53,556 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-01-12 15:55:53,961 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-12 15:55:54,385 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-12 15:55:54,764 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-12 15:55:54,926 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-12 15:55:55,289 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 15:55:55,622 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-01-12 15:55:56,006 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-12 15:55:56,279 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-12 15:55:56,512 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-01-12 15:55:56,938 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-12 15:55:57,278 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-01-12 15:55:57,479 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-01-12 15:55:57,964 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-01-12 15:55:58,475 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-01-12 15:55:58,634 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-01-12 15:55:58,928 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-01-12 15:55:59,918 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-01-12 15:56:00,305 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-01-12 15:56:01,262 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-12 15:56:01,742 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-12 15:56:02,602 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-01-12 15:56:02,849 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-01-12 15:56:03,236 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-01-12 15:56:03,460 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-12 15:56:03,725 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-12 15:56:04,151 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-01-12 15:56:04,283 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-01-12 15:56:04,598 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-01-12 15:56:05,094 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-01-12 15:56:05,273 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-12 15:56:05,436 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 15:56:05,794 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 15:56:06,006 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-12 15:56:06,283 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-01-12 15:56:06,485 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-12 15:56:06,837 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-12 15:56:07,025 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-01-12 15:56:07,648 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-01-12 15:56:07,814 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-12 15:56:08,221 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 15:56:08,412 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-12 15:56:09,110 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-01-12 15:56:09,517 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-01-12 15:56:10,116 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-12 15:56:10,267 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-12 15:56:10,500 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-01-12 15:56:10,640 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-12 15:56:11,082 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 15:56:11,694 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-01-12 15:56:11,846 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-12 15:56:12,038 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 15:56:12,233 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-01-12 15:56:13,126 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-12 15:56:13,282 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-12 15:56:13,476 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-12 15:56:13,644 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-01-12 15:56:14,176 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-12 15:56:14,490 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-01-12 15:56:14,656 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-01-12 15:56:15,561 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-12 15:56:15,722 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-01-12 15:56:15,993 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-12 15:56:16,368 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-01-12 15:56:16,893 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-12 15:56:17,155 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-01-12 15:56:17,956 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-12 15:56:18,365 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-12 15:56:18,789 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-12 15:56:19,156 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-01-12 15:56:19,518 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-12 15:56:20,080 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-12 15:56:20,234 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-12 15:56:20,542 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-12 15:56:20,912 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-01-12 15:56:21,061 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-12 15:56:21,982 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-01-12 15:56:22,221 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-01-12 15:56:22,382 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-01-12 15:56:23,038 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-01-12 15:56:23,252 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-01-12 15:56:23,521 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-01-12 15:56:24,421 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-01-12 15:56:24,660 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-01-12 15:56:25,408 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-01-12 15:56:25,661 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-01-12 15:56:26,231 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-01-12 15:56:26,666 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-01-12 15:56:27,182 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-01-12 15:56:27,663 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-12 15:56:27,869 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-12 15:56:28,763 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-12 15:56:31,103 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-01-12 15:56:31,669 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-01-12 15:56:32,355 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-01-12 15:56:32,986 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-01-12 15:56:33,700 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-01-12 15:56:33,947 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-01-12 15:56:34,666 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-01-12 15:56:34,916 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-01-12 15:56:35,624 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-01-12 15:56:35,943 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-01-12 15:56:36,159 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-01-12 15:56:36,435 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-01-12 15:56:37,182 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-01-12 15:56:37,474 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-01-12 15:56:37,683 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-01-12 15:56:37,970 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-12 15:56:38,761 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-01-12 15:56:39,016 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-12 15:56:39,859 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-01-12 15:56:40,078 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-12 15:56:41,434 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-01-12 15:56:41,630 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-12 15:56:42,265 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-01-12 15:56:42,452 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-12 15:56:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:56:56,438 INFO L93 Difference]: Finished difference Result 299094 states and 374745 transitions. [2019-01-12 15:56:56,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 575 states. [2019-01-12 15:56:56,438 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2019-01-12 15:56:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:56:56,732 INFO L225 Difference]: With dead ends: 299094 [2019-01-12 15:56:56,733 INFO L226 Difference]: Without dead ends: 288082 [2019-01-12 15:56:56,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 592 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175220 ImplicationChecksByTransitivity, 97.7s TimeCoverageRelationStatistics Valid=36014, Invalid=316228, Unknown=0, NotChecked=0, Total=352242 [2019-01-12 15:56:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288082 states. [2019-01-12 15:57:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288082 to 51072. [2019-01-12 15:57:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51072 states. [2019-01-12 15:57:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51072 states to 51072 states and 66079 transitions. [2019-01-12 15:57:04,638 INFO L78 Accepts]: Start accepts. Automaton has 51072 states and 66079 transitions. Word has length 70 [2019-01-12 15:57:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:57:04,638 INFO L480 AbstractCegarLoop]: Abstraction has 51072 states and 66079 transitions. [2019-01-12 15:57:04,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 15:57:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 51072 states and 66079 transitions. [2019-01-12 15:57:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 15:57:04,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:57:04,644 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:57:04,644 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:57:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:57:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1898192212, now seen corresponding path program 1 times [2019-01-12 15:57:04,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:57:04,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:57:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:57:04,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:57:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:57:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:57:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:57:04,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:57:04,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:57:04,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:57:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:57:04,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:57:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:57:05,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:57:05,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-01-12 15:57:05,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:57:05,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:57:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:57:05,251 INFO L87 Difference]: Start difference. First operand 51072 states and 66079 transitions. Second operand 15 states. [2019-01-12 15:57:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:57:29,121 INFO L93 Difference]: Finished difference Result 173844 states and 221212 transitions. [2019-01-12 15:57:29,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-12 15:57:29,123 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2019-01-12 15:57:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:57:29,253 INFO L225 Difference]: With dead ends: 173844 [2019-01-12 15:57:29,253 INFO L226 Difference]: Without dead ends: 127239 [2019-01-12 15:57:29,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 15:57:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127239 states. [2019-01-12 15:57:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127239 to 62770. [2019-01-12 15:57:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62770 states. [2019-01-12 15:57:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62770 states to 62770 states and 80450 transitions. [2019-01-12 15:57:38,225 INFO L78 Accepts]: Start accepts. Automaton has 62770 states and 80450 transitions. Word has length 70 [2019-01-12 15:57:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:57:38,225 INFO L480 AbstractCegarLoop]: Abstraction has 62770 states and 80450 transitions. [2019-01-12 15:57:38,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:57:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62770 states and 80450 transitions. [2019-01-12 15:57:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 15:57:38,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:57:38,231 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:57:38,231 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:57:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:57:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash -468502382, now seen corresponding path program 1 times [2019-01-12 15:57:38,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:57:38,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:57:38,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:57:38,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:57:38,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:57:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:57:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:57:38,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:57:38,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:57:38,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:57:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:57:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:57:38,602 INFO L87 Difference]: Start difference. First operand 62770 states and 80450 transitions. Second operand 6 states. [2019-01-12 15:57:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:57:44,634 INFO L93 Difference]: Finished difference Result 100615 states and 128664 transitions. [2019-01-12 15:57:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:57:44,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-01-12 15:57:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:57:44,678 INFO L225 Difference]: With dead ends: 100615 [2019-01-12 15:57:44,678 INFO L226 Difference]: Without dead ends: 42296 [2019-01-12 15:57:44,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:57:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42296 states. [2019-01-12 15:57:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42296 to 38738. [2019-01-12 15:57:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-01-12 15:57:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 48497 transitions. [2019-01-12 15:57:50,245 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 48497 transitions. Word has length 70 [2019-01-12 15:57:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:57:50,245 INFO L480 AbstractCegarLoop]: Abstraction has 38738 states and 48497 transitions. [2019-01-12 15:57:50,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:57:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 48497 transitions. [2019-01-12 15:57:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-12 15:57:50,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:57:50,250 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:57:50,250 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:57:50,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:57:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash 617046017, now seen corresponding path program 1 times [2019-01-12 15:57:50,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:57:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:57:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:57:50,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:57:50,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:57:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:57:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:57:50,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:57:50,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:57:50,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:57:50,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:57:50,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:57:50,330 INFO L87 Difference]: Start difference. First operand 38738 states and 48497 transitions. Second operand 3 states. [2019-01-12 15:57:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:57:55,568 INFO L93 Difference]: Finished difference Result 47868 states and 59761 transitions. [2019-01-12 15:57:55,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:57:55,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-12 15:57:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:57:55,603 INFO L225 Difference]: With dead ends: 47868 [2019-01-12 15:57:55,603 INFO L226 Difference]: Without dead ends: 37675 [2019-01-12 15:57:55,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:57:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37675 states. [2019-01-12 15:58:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37675 to 37673. [2019-01-12 15:58:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37673 states. [2019-01-12 15:58:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37673 states to 37673 states and 46579 transitions. [2019-01-12 15:58:00,935 INFO L78 Accepts]: Start accepts. Automaton has 37673 states and 46579 transitions. Word has length 71 [2019-01-12 15:58:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:58:00,935 INFO L480 AbstractCegarLoop]: Abstraction has 37673 states and 46579 transitions. [2019-01-12 15:58:00,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:58:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 37673 states and 46579 transitions. [2019-01-12 15:58:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:58:00,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:58:00,939 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:58:00,939 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:58:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:58:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1402634332, now seen corresponding path program 1 times [2019-01-12 15:58:00,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:58:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:58:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:58:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:58:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:58:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:58:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:58:01,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:58:01,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:58:01,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:58:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:58:01,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:58:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:58:03,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:58:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 36 [2019-01-12 15:58:03,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 15:58:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 15:58:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:58:03,031 INFO L87 Difference]: Start difference. First operand 37673 states and 46579 transitions. Second operand 36 states. [2019-01-12 15:58:04,541 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-12 15:58:04,841 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-01-12 15:58:05,343 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-12 15:58:06,329 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-01-12 15:58:08,065 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-01-12 15:58:08,361 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-12 15:58:09,050 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-01-12 15:58:09,218 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-01-12 15:58:09,494 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-01-12 15:58:09,976 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-01-12 15:58:10,238 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-01-12 15:58:10,432 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-01-12 15:58:11,237 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-12 15:58:11,410 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-01-12 15:58:11,591 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-12 15:58:11,991 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-01-12 15:58:12,370 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-01-12 15:58:12,574 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-12 15:58:12,719 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-01-12 15:58:13,068 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-01-12 15:58:13,350 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-01-12 15:58:13,600 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-12 15:58:14,009 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-01-12 15:58:14,244 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-01-12 15:58:14,772 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-01-12 15:58:15,000 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-12 15:58:15,196 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-01-12 15:58:15,732 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-01-12 15:58:15,967 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-12 15:58:16,248 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-12 15:58:16,614 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-01-12 15:58:17,048 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-01-12 15:58:17,311 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-12 15:58:17,474 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-12 15:58:17,738 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2019-01-12 15:58:17,975 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-12 15:58:18,313 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-01-12 15:58:18,590 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-01-12 15:58:18,826 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-01-12 15:58:19,052 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-01-12 15:58:19,402 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-12 15:58:19,665 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-12 15:58:19,866 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-01-12 15:58:20,182 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-01-12 15:58:20,398 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-01-12 15:58:20,639 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-12 15:58:21,047 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-12 15:58:21,683 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-01-12 15:58:21,860 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-12 15:58:22,040 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-01-12 15:58:22,234 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-01-12 15:58:22,489 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-01-12 15:58:22,676 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-01-12 15:58:23,015 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 15:58:23,278 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-01-12 15:58:23,710 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-01-12 15:58:24,363 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-01-12 15:58:24,911 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-01-12 15:58:26,782 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-12 15:58:27,050 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-01-12 15:58:28,062 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-12 15:58:28,416 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-12 15:58:28,695 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-12 15:58:31,553 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-12 15:58:31,711 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-12 15:58:32,314 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-01-12 15:58:33,159 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-01-12 15:58:33,303 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-12 15:58:33,807 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-01-12 15:58:34,045 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-12 15:58:34,517 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-01-12 15:58:34,692 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-01-12 15:58:34,874 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-12 15:58:35,024 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-01-12 15:58:35,432 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-01-12 15:58:35,671 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-01-12 15:58:35,828 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-12 15:58:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:58:44,277 INFO L93 Difference]: Finished difference Result 103211 states and 126813 transitions. [2019-01-12 15:58:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-01-12 15:58:44,277 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-01-12 15:58:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:58:44,353 INFO L225 Difference]: With dead ends: 103211 [2019-01-12 15:58:44,354 INFO L226 Difference]: Without dead ends: 79333 [2019-01-12 15:58:44,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14790 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=4870, Invalid=35732, Unknown=0, NotChecked=0, Total=40602 [2019-01-12 15:58:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79333 states. [2019-01-12 15:58:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79333 to 52617. [2019-01-12 15:58:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52617 states. [2019-01-12 15:58:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52617 states to 52617 states and 65098 transitions. [2019-01-12 15:58:52,492 INFO L78 Accepts]: Start accepts. Automaton has 52617 states and 65098 transitions. Word has length 72 [2019-01-12 15:58:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:58:52,492 INFO L480 AbstractCegarLoop]: Abstraction has 52617 states and 65098 transitions. [2019-01-12 15:58:52,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 15:58:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52617 states and 65098 transitions. [2019-01-12 15:58:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:58:52,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:58:52,502 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:58:52,503 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:58:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:58:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash -310258425, now seen corresponding path program 1 times [2019-01-12 15:58:52,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:58:52,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:58:52,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:58:52,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:58:52,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:58:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:58:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:58:52,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:58:52,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:58:52,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:58:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:58:52,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:58:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:58:52,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:58:52,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-12 15:58:52,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:58:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:58:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:58:52,806 INFO L87 Difference]: Start difference. First operand 52617 states and 65098 transitions. Second operand 4 states. [2019-01-12 15:59:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:59:07,422 INFO L93 Difference]: Finished difference Result 152298 states and 188305 transitions. [2019-01-12 15:59:07,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:59:07,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-12 15:59:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:59:07,530 INFO L225 Difference]: With dead ends: 152298 [2019-01-12 15:59:07,530 INFO L226 Difference]: Without dead ends: 99737 [2019-01-12 15:59:07,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:59:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99737 states. [2019-01-12 15:59:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99737 to 76472. [2019-01-12 15:59:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76472 states. [2019-01-12 15:59:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76472 states to 76472 states and 94176 transitions. [2019-01-12 15:59:20,161 INFO L78 Accepts]: Start accepts. Automaton has 76472 states and 94176 transitions. Word has length 95 [2019-01-12 15:59:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:59:20,161 INFO L480 AbstractCegarLoop]: Abstraction has 76472 states and 94176 transitions. [2019-01-12 15:59:20,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:59:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 76472 states and 94176 transitions. [2019-01-12 15:59:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:59:20,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:59:20,175 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:59:20,175 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:59:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:59:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2139341705, now seen corresponding path program 1 times [2019-01-12 15:59:20,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:59:20,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:59:20,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:59:20,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:59:20,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:59:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:59:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-12 15:59:20,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:59:20,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:59:20,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:59:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:59:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:59:20,607 INFO L87 Difference]: Start difference. First operand 76472 states and 94176 transitions. Second operand 6 states. [2019-01-12 15:59:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:59:30,554 INFO L93 Difference]: Finished difference Result 91712 states and 112914 transitions. [2019-01-12 15:59:30,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:59:30,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-12 15:59:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:59:30,611 INFO L225 Difference]: With dead ends: 91712 [2019-01-12 15:59:30,611 INFO L226 Difference]: Without dead ends: 62612 [2019-01-12 15:59:30,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:59:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62612 states. [2019-01-12 15:59:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62612 to 60853. [2019-01-12 15:59:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60853 states. [2019-01-12 15:59:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60853 states to 60853 states and 74567 transitions. [2019-01-12 15:59:40,313 INFO L78 Accepts]: Start accepts. Automaton has 60853 states and 74567 transitions. Word has length 95 [2019-01-12 15:59:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:59:40,313 INFO L480 AbstractCegarLoop]: Abstraction has 60853 states and 74567 transitions. [2019-01-12 15:59:40,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:59:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 60853 states and 74567 transitions. [2019-01-12 15:59:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 15:59:40,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:59:40,328 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:59:40,328 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:59:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:59:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1243063571, now seen corresponding path program 2 times [2019-01-12 15:59:40,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:59:40,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:59:40,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:59:40,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:59:40,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:59:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:59:40,546 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2019-01-12 15:59:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:59:40,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:59:40,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:59:40,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:59:40,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:59:40,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:59:40,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:59:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 19 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-12 15:59:40,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:59:40,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13 [2019-01-12 15:59:40,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:59:40,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:59:40,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:59:40,898 INFO L87 Difference]: Start difference. First operand 60853 states and 74567 transitions. Second operand 13 states. [2019-01-12 15:59:41,416 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-12 16:00:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:00:03,729 INFO L93 Difference]: Finished difference Result 158078 states and 193600 transitions. [2019-01-12 16:00:03,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-12 16:00:03,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-01-12 16:00:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:00:03,839 INFO L225 Difference]: With dead ends: 158078 [2019-01-12 16:00:03,839 INFO L226 Difference]: Without dead ends: 109961 [2019-01-12 16:00:03,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2202 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1224, Invalid=4628, Unknown=0, NotChecked=0, Total=5852 [2019-01-12 16:00:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109961 states. [2019-01-12 16:00:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109961 to 91633. [2019-01-12 16:00:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91633 states. [2019-01-12 16:00:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91633 states to 91633 states and 111359 transitions. [2019-01-12 16:00:19,117 INFO L78 Accepts]: Start accepts. Automaton has 91633 states and 111359 transitions. Word has length 104 [2019-01-12 16:00:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:00:19,117 INFO L480 AbstractCegarLoop]: Abstraction has 91633 states and 111359 transitions. [2019-01-12 16:00:19,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 16:00:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 91633 states and 111359 transitions. [2019-01-12 16:00:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 16:00:19,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:00:19,135 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:00:19,135 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:00:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:00:19,135 INFO L82 PathProgramCache]: Analyzing trace with hash -719825780, now seen corresponding path program 1 times [2019-01-12 16:00:19,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:00:19,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:00:19,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:00:19,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 16:00:19,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:00:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:00:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-12 16:00:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:00:19,625 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 16:00:19,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:00:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:00:19,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:00:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-12 16:00:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:00:19,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2019-01-12 16:00:19,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 16:00:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 16:00:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-01-12 16:00:19,813 INFO L87 Difference]: Start difference. First operand 91633 states and 111359 transitions. Second operand 16 states. [2019-01-12 16:00:20,084 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-12 16:00:20,210 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-12 16:00:20,399 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-12 16:00:20,762 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-12 16:00:20,880 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-12 16:00:21,058 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-12 16:00:21,207 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-12 16:00:21,394 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-12 16:00:21,652 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-12 16:00:21,783 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-12 16:00:22,079 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-01-12 16:00:22,211 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-12 16:00:22,865 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-12 16:00:23,206 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-12 16:00:23,372 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-12 16:00:23,503 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-01-12 16:00:23,722 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-12 16:00:23,857 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-12 16:00:24,043 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-12 16:00:24,216 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-12 16:00:24,371 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-12 16:00:25,019 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-12 16:00:25,267 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-01-12 16:00:25,976 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-12 16:00:26,159 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-12 16:00:27,000 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-12 16:00:27,252 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-12 16:00:27,564 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-12 16:00:27,714 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-12 16:00:27,853 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-12 16:00:28,024 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-01-12 16:00:28,166 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-12 16:00:28,445 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-12 16:00:28,580 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-12 16:00:28,732 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-12 16:00:28,895 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-12 16:00:29,172 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-12 16:00:29,328 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-01-12 16:00:29,795 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-12 16:00:29,961 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-12 16:00:30,122 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-12 16:00:30,491 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-12 16:00:31,372 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-12 16:00:32,075 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-12 16:00:32,742 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-12 16:00:33,070 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-12 16:00:34,083 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-12 16:00:34,881 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-12 16:00:35,083 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-12 16:00:35,365 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-01-12 16:00:35,574 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-12 16:00:35,787 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-12 16:00:35,928 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-01-12 16:00:36,286 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-12 16:00:36,551 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-12 16:00:40,901 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-12 16:00:41,155 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-12 16:00:41,774 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-12 16:00:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:00:43,970 INFO L93 Difference]: Finished difference Result 137030 states and 165800 transitions. [2019-01-12 16:00:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-01-12 16:00:43,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 116 [2019-01-12 16:00:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:00:44,010 INFO L225 Difference]: With dead ends: 137030 [2019-01-12 16:00:44,010 INFO L226 Difference]: Without dead ends: 45448 [2019-01-12 16:00:44,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7541 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=2994, Invalid=15912, Unknown=0, NotChecked=0, Total=18906 [2019-01-12 16:00:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45448 states. [2019-01-12 16:00:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45448 to 25514. [2019-01-12 16:00:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25514 states. [2019-01-12 16:00:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25514 states to 25514 states and 29876 transitions. [2019-01-12 16:00:49,270 INFO L78 Accepts]: Start accepts. Automaton has 25514 states and 29876 transitions. Word has length 116 [2019-01-12 16:00:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:00:49,270 INFO L480 AbstractCegarLoop]: Abstraction has 25514 states and 29876 transitions. [2019-01-12 16:00:49,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 16:00:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25514 states and 29876 transitions. [2019-01-12 16:00:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 16:00:49,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:00:49,275 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:00:49,276 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:00:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:00:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1989910784, now seen corresponding path program 1 times [2019-01-12 16:00:49,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:00:49,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:00:49,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:00:49,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:00:49,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:00:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:00:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 16:00:49,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:00:49,937 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 16:00:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:00:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:00:50,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:00:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 16:00:50,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:00:50,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2019-01-12 16:00:50,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 16:00:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 16:00:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2019-01-12 16:00:50,911 INFO L87 Difference]: Start difference. First operand 25514 states and 29876 transitions. Second operand 25 states. [2019-01-12 16:00:52,590 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-01-12 16:00:52,978 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-12 16:00:53,622 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-12 16:00:54,272 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-01-12 16:00:54,810 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-01-12 16:00:55,440 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-01-12 16:00:56,458 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-01-12 16:00:56,889 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-01-12 16:00:57,071 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-01-12 16:00:57,424 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-01-12 16:00:57,838 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-01-12 16:00:58,023 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-01-12 16:01:00,447 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-01-12 16:01:00,883 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-01-12 16:01:01,364 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-12 16:01:01,797 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-01-12 16:01:02,256 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-01-12 16:01:06,979 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-01-12 16:01:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:01:24,319 INFO L93 Difference]: Finished difference Result 77543 states and 90289 transitions. [2019-01-12 16:01:24,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2019-01-12 16:01:24,320 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 118 [2019-01-12 16:01:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:01:24,377 INFO L225 Difference]: With dead ends: 77543 [2019-01-12 16:01:24,378 INFO L226 Difference]: Without dead ends: 68512 [2019-01-12 16:01:24,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15595 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=4385, Invalid=37027, Unknown=0, NotChecked=0, Total=41412 [2019-01-12 16:01:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68512 states. [2019-01-12 16:01:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68512 to 38140. [2019-01-12 16:01:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38140 states. [2019-01-12 16:01:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38140 states to 38140 states and 44550 transitions. [2019-01-12 16:01:32,707 INFO L78 Accepts]: Start accepts. Automaton has 38140 states and 44550 transitions. Word has length 118 [2019-01-12 16:01:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:01:32,708 INFO L480 AbstractCegarLoop]: Abstraction has 38140 states and 44550 transitions. [2019-01-12 16:01:32,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 16:01:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38140 states and 44550 transitions. [2019-01-12 16:01:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 16:01:32,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:01:32,714 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:01:32,715 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:01:32,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:01:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1463958266, now seen corresponding path program 1 times [2019-01-12 16:01:32,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:01:32,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:01:32,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:01:32,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:01:32,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:01:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:01:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-12 16:01:32,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:01:32,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:01:32,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:01:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:01:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:01:32,806 INFO L87 Difference]: Start difference. First operand 38140 states and 44550 transitions. Second operand 3 states. [2019-01-12 16:01:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:01:37,644 INFO L93 Difference]: Finished difference Result 56727 states and 66440 transitions. [2019-01-12 16:01:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:01:37,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-12 16:01:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:01:37,662 INFO L225 Difference]: With dead ends: 56727 [2019-01-12 16:01:37,662 INFO L226 Difference]: Without dead ends: 20424 [2019-01-12 16:01:37,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:01:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20424 states. [2019-01-12 16:01:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20424 to 20279. [2019-01-12 16:01:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20279 states. [2019-01-12 16:01:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20279 states to 20279 states and 23398 transitions. [2019-01-12 16:01:42,121 INFO L78 Accepts]: Start accepts. Automaton has 20279 states and 23398 transitions. Word has length 120 [2019-01-12 16:01:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:01:42,121 INFO L480 AbstractCegarLoop]: Abstraction has 20279 states and 23398 transitions. [2019-01-12 16:01:42,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:01:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 20279 states and 23398 transitions. [2019-01-12 16:01:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 16:01:42,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:01:42,128 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:01:42,128 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:01:42,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:01:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1336352401, now seen corresponding path program 1 times [2019-01-12 16:01:42,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:01:42,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:01:42,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:01:42,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:01:42,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:01:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:01:42,595 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 16:01:42,882 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 16:01:43,182 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-01-12 16:01:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:01:43,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:01:43,579 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 16:01:43,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:01:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:01:43,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:01:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 16:01:44,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:01:44,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2019-01-12 16:01:44,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 16:01:44,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 16:01:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-01-12 16:01:44,655 INFO L87 Difference]: Start difference. First operand 20279 states and 23398 transitions. Second operand 25 states. [2019-01-12 16:01:45,472 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-12 16:01:45,803 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-01-12 16:01:46,769 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-01-12 16:01:47,061 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2019-01-12 16:01:47,224 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-01-12 16:01:47,369 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 41 [2019-01-12 16:01:47,599 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-01-12 16:01:47,814 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-01-12 16:01:48,018 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-12 16:01:48,363 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-01-12 16:01:48,588 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-01-12 16:01:48,992 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-01-12 16:01:49,258 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-01-12 16:01:49,474 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-01-12 16:01:50,272 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-01-12 16:01:50,570 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-01-12 16:01:50,918 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-01-12 16:01:51,063 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-01-12 16:01:51,279 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-01-12 16:01:51,481 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-12 16:01:51,778 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-01-12 16:01:52,189 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-01-12 16:01:52,471 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-01-12 16:01:53,287 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-01-12 16:01:53,467 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-01-12 16:01:53,632 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-01-12 16:01:53,861 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-01-12 16:01:54,295 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-01-12 16:01:54,817 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-01-12 16:01:54,984 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-01-12 16:01:55,339 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-01-12 16:01:55,570 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-01-12 16:01:55,765 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-01-12 16:01:55,995 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-01-12 16:02:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:02:04,629 INFO L93 Difference]: Finished difference Result 42762 states and 49163 transitions. [2019-01-12 16:02:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-12 16:02:04,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 120 [2019-01-12 16:02:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:02:04,653 INFO L225 Difference]: With dead ends: 42762 [2019-01-12 16:02:04,653 INFO L226 Difference]: Without dead ends: 27408 [2019-01-12 16:02:04,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1150, Invalid=5491, Unknown=1, NotChecked=0, Total=6642 [2019-01-12 16:02:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-01-12 16:02:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20262. [2019-01-12 16:02:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20262 states. [2019-01-12 16:02:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20262 states to 20262 states and 23277 transitions. [2019-01-12 16:02:10,031 INFO L78 Accepts]: Start accepts. Automaton has 20262 states and 23277 transitions. Word has length 120 [2019-01-12 16:02:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:02:10,031 INFO L480 AbstractCegarLoop]: Abstraction has 20262 states and 23277 transitions. [2019-01-12 16:02:10,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 16:02:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 20262 states and 23277 transitions. [2019-01-12 16:02:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 16:02:10,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:02:10,036 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:02:10,036 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:02:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:02:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash 471660008, now seen corresponding path program 1 times [2019-01-12 16:02:10,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:02:10,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:02:10,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:02:10,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:02:10,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:02:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:02:10,423 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 16:02:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:02:10,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:02:10,712 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 16:02:10,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:02:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:02:10,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:02:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 34 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:02:11,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:02:11,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-01-12 16:02:11,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 16:02:11,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 16:02:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-01-12 16:02:11,218 INFO L87 Difference]: Start difference. First operand 20262 states and 23277 transitions. Second operand 22 states. [2019-01-12 16:02:13,620 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-01-12 16:02:13,973 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-12 16:02:14,828 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-12 16:02:15,948 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-01-12 16:02:16,123 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-01-12 16:02:16,280 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-01-12 16:02:16,414 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-12 16:02:16,891 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-12 16:02:17,219 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-01-12 16:02:17,501 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-01-12 16:02:17,911 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-12 16:02:18,065 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-01-12 16:02:18,221 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-01-12 16:02:18,564 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-12 16:02:19,148 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-01-12 16:02:19,448 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-12 16:02:19,723 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-01-12 16:02:19,919 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-12 16:02:20,075 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-01-12 16:02:20,873 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-01-12 16:02:21,619 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-01-12 16:02:21,829 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-01-12 16:02:22,660 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-01-12 16:02:22,976 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-01-12 16:02:23,361 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-01-12 16:02:23,957 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-01-12 16:02:24,450 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-01-12 16:02:24,827 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-12 16:02:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:02:29,864 INFO L93 Difference]: Finished difference Result 37153 states and 42614 transitions. [2019-01-12 16:02:29,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-12 16:02:29,865 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2019-01-12 16:02:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:02:29,889 INFO L225 Difference]: With dead ends: 37153 [2019-01-12 16:02:29,889 INFO L226 Difference]: Without dead ends: 23910 [2019-01-12 16:02:29,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1682, Invalid=7824, Unknown=0, NotChecked=0, Total=9506 [2019-01-12 16:02:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23910 states. [2019-01-12 16:02:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23910 to 14129. [2019-01-12 16:02:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2019-01-12 16:02:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 16143 transitions. [2019-01-12 16:02:33,977 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 16143 transitions. Word has length 121 [2019-01-12 16:02:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:02:33,978 INFO L480 AbstractCegarLoop]: Abstraction has 14129 states and 16143 transitions. [2019-01-12 16:02:33,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 16:02:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 16143 transitions. [2019-01-12 16:02:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 16:02:33,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:02:33,981 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:02:33,982 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:02:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:02:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash 79598664, now seen corresponding path program 1 times [2019-01-12 16:02:33,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:02:33,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:02:33,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:02:33,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:02:33,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:02:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:02:34,442 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 16:02:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:02:34,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:02:34,680 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 16:02:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:02:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:02:34,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:02:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 58 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 16:02:35,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:02:35,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-01-12 16:02:35,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 16:02:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 16:02:35,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-01-12 16:02:35,106 INFO L87 Difference]: Start difference. First operand 14129 states and 16143 transitions. Second operand 22 states. [2019-01-12 16:02:38,454 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-12 16:02:39,923 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-01-12 16:02:40,896 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-01-12 16:02:41,135 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-01-12 16:02:41,429 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-01-12 16:02:41,761 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-01-12 16:02:42,135 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-01-12 16:02:42,863 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-01-12 16:02:43,216 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-01-12 16:02:43,532 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-01-12 16:02:44,719 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-01-12 16:02:45,077 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-01-12 16:02:45,265 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-01-12 16:02:45,577 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-12 16:02:45,760 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-01-12 16:02:46,194 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-01-12 16:02:46,385 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-01-12 16:02:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:02:51,333 INFO L93 Difference]: Finished difference Result 28030 states and 32099 transitions. [2019-01-12 16:02:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-12 16:02:51,334 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2019-01-12 16:02:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:02:51,354 INFO L225 Difference]: With dead ends: 28030 [2019-01-12 16:02:51,354 INFO L226 Difference]: Without dead ends: 19118 [2019-01-12 16:02:51,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1276, Invalid=5530, Unknown=0, NotChecked=0, Total=6806 [2019-01-12 16:02:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19118 states. [2019-01-12 16:02:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19118 to 11977. [2019-01-12 16:02:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11977 states. [2019-01-12 16:02:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11977 states to 11977 states and 13570 transitions. [2019-01-12 16:02:55,261 INFO L78 Accepts]: Start accepts. Automaton has 11977 states and 13570 transitions. Word has length 121 [2019-01-12 16:02:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:02:55,261 INFO L480 AbstractCegarLoop]: Abstraction has 11977 states and 13570 transitions. [2019-01-12 16:02:55,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 16:02:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 11977 states and 13570 transitions. [2019-01-12 16:02:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 16:02:55,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:02:55,264 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:02:55,265 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:02:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:02:55,265 INFO L82 PathProgramCache]: Analyzing trace with hash -597801272, now seen corresponding path program 1 times [2019-01-12 16:02:55,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:02:55,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:02:55,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:02:55,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:02:55,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:02:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:02:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:02:55,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:02:55,770 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 16:02:55,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:02:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:02:55,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:02:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:02:57,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:02:57,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-01-12 16:02:57,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 16:02:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 16:02:57,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-01-12 16:02:57,324 INFO L87 Difference]: Start difference. First operand 11977 states and 13570 transitions. Second operand 32 states. [2019-01-12 16:02:57,608 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-01-12 16:03:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:03:07,559 INFO L93 Difference]: Finished difference Result 20841 states and 23584 transitions. [2019-01-12 16:03:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 16:03:07,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 123 [2019-01-12 16:03:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:03:07,573 INFO L225 Difference]: With dead ends: 20841 [2019-01-12 16:03:07,573 INFO L226 Difference]: Without dead ends: 17389 [2019-01-12 16:03:07,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=385, Invalid=2371, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 16:03:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17389 states. [2019-01-12 16:03:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17389 to 13481. [2019-01-12 16:03:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13481 states. [2019-01-12 16:03:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 15262 transitions. [2019-01-12 16:03:11,960 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 15262 transitions. Word has length 123 [2019-01-12 16:03:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:03:11,961 INFO L480 AbstractCegarLoop]: Abstraction has 13481 states and 15262 transitions. [2019-01-12 16:03:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 16:03:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 15262 transitions. [2019-01-12 16:03:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 16:03:11,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:03:11,964 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:03:11,964 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:03:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:03:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2096456030, now seen corresponding path program 1 times [2019-01-12 16:03:11,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:03:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:03:11,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:03:11,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:03:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:03:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:03:12,418 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 16:03:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 30 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:03:12,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:03:12,648 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 16:03:12,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:03:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:03:12,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:03:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 34 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:03:13,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:03:13,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-01-12 16:03:13,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 16:03:13,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 16:03:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-01-12 16:03:13,512 INFO L87 Difference]: Start difference. First operand 13481 states and 15262 transitions. Second operand 21 states. [2019-01-12 16:03:15,739 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-12 16:03:17,170 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:03:19,915 WARN L181 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-01-12 16:03:20,197 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-01-12 16:03:21,136 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-01-12 16:03:21,971 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-01-12 16:03:23,268 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-12 16:03:23,554 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-01-12 16:03:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:03:34,031 INFO L93 Difference]: Finished difference Result 33906 states and 38075 transitions. [2019-01-12 16:03:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 16:03:34,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 123 [2019-01-12 16:03:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:03:34,056 INFO L225 Difference]: With dead ends: 33906 [2019-01-12 16:03:34,056 INFO L226 Difference]: Without dead ends: 28802 [2019-01-12 16:03:34,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=503, Invalid=2358, Unknown=1, NotChecked=0, Total=2862 [2019-01-12 16:03:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28802 states. [2019-01-12 16:03:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28802 to 17652. [2019-01-12 16:03:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17652 states. [2019-01-12 16:03:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17652 states to 17652 states and 19892 transitions. [2019-01-12 16:03:40,349 INFO L78 Accepts]: Start accepts. Automaton has 17652 states and 19892 transitions. Word has length 123 [2019-01-12 16:03:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:03:40,350 INFO L480 AbstractCegarLoop]: Abstraction has 17652 states and 19892 transitions. [2019-01-12 16:03:40,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 16:03:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 17652 states and 19892 transitions. [2019-01-12 16:03:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 16:03:40,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:03:40,353 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:03:40,354 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:03:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:03:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash -714291388, now seen corresponding path program 1 times [2019-01-12 16:03:40,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:03:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:03:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:03:40,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:03:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:03:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:03:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:03:41,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:03:41,496 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 16:03:41,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:03:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:03:41,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:03:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 19 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:03:43,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:03:43,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 46 [2019-01-12 16:03:43,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-12 16:03:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-12 16:03:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 16:03:43,406 INFO L87 Difference]: Start difference. First operand 17652 states and 19892 transitions. Second operand 46 states. [2019-01-12 16:03:50,037 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-01-12 16:03:50,296 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-01-12 16:03:50,991 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-12 16:03:51,198 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-12 16:03:56,016 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-12 16:03:56,286 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-01-12 16:04:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:04:00,153 INFO L93 Difference]: Finished difference Result 25879 states and 29064 transitions. [2019-01-12 16:04:00,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-12 16:04:00,153 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2019-01-12 16:04:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:04:00,169 INFO L225 Difference]: With dead ends: 25879 [2019-01-12 16:04:00,169 INFO L226 Difference]: Without dead ends: 20973 [2019-01-12 16:04:00,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1177, Invalid=9125, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 16:04:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20973 states. [2019-01-12 16:04:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20973 to 18430. [2019-01-12 16:04:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18430 states. [2019-01-12 16:04:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18430 states to 18430 states and 20766 transitions. [2019-01-12 16:04:06,750 INFO L78 Accepts]: Start accepts. Automaton has 18430 states and 20766 transitions. Word has length 123 [2019-01-12 16:04:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:04:06,750 INFO L480 AbstractCegarLoop]: Abstraction has 18430 states and 20766 transitions. [2019-01-12 16:04:06,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-12 16:04:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18430 states and 20766 transitions. [2019-01-12 16:04:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 16:04:06,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:04:06,755 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:04:06,756 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:04:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:04:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1776651436, now seen corresponding path program 1 times [2019-01-12 16:04:06,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:04:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:04:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:04:06,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:04:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:04:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:04:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:04:07,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:04:07,430 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 16:04:07,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:04:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:04:07,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:04:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:04:08,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:04:08,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-01-12 16:04:08,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-12 16:04:08,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-12 16:04:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 16:04:08,575 INFO L87 Difference]: Start difference. First operand 18430 states and 20766 transitions. Second operand 34 states. [2019-01-12 16:04:13,041 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-01-12 16:04:14,307 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-01-12 16:04:15,274 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-01-12 16:04:15,713 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-12 16:04:15,881 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-01-12 16:04:16,596 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-01-12 16:04:16,945 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-12 16:04:17,244 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-12 16:04:19,644 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-12 16:04:20,463 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-12 16:04:21,392 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-12 16:04:21,942 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-12 16:04:23,676 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-12 16:04:24,162 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-01-12 16:04:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:04:39,366 INFO L93 Difference]: Finished difference Result 37033 states and 41614 transitions. [2019-01-12 16:04:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-12 16:04:39,368 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 123 [2019-01-12 16:04:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:04:39,398 INFO L225 Difference]: With dead ends: 37033 [2019-01-12 16:04:39,398 INFO L226 Difference]: Without dead ends: 33586 [2019-01-12 16:04:39,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5355 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1820, Invalid=16269, Unknown=1, NotChecked=0, Total=18090 [2019-01-12 16:04:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33586 states. [2019-01-12 16:04:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33586 to 21906. [2019-01-12 16:04:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21906 states. [2019-01-12 16:04:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21906 states to 21906 states and 24627 transitions. [2019-01-12 16:04:47,397 INFO L78 Accepts]: Start accepts. Automaton has 21906 states and 24627 transitions. Word has length 123 [2019-01-12 16:04:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:04:47,398 INFO L480 AbstractCegarLoop]: Abstraction has 21906 states and 24627 transitions. [2019-01-12 16:04:47,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-12 16:04:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21906 states and 24627 transitions. [2019-01-12 16:04:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 16:04:47,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:04:47,401 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:04:47,402 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:04:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:04:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1354284566, now seen corresponding path program 2 times [2019-01-12 16:04:47,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:04:47,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:04:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:04:47,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:04:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:04:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:04:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:04:48,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:04:48,404 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 16:04:48,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 16:04:48,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 16:04:48,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 16:04:48,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:04:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-12 16:04:48,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:04:48,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2019-01-12 16:04:48,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 16:04:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 16:04:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-01-12 16:04:48,974 INFO L87 Difference]: Start difference. First operand 21906 states and 24627 transitions. Second operand 25 states. [2019-01-12 16:04:49,699 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-01-12 16:04:50,043 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-01-12 16:04:50,356 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-01-12 16:04:50,511 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-01-12 16:04:50,803 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-01-12 16:04:51,150 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-01-12 16:04:51,606 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-01-12 16:04:52,046 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-01-12 16:04:52,670 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-01-12 16:04:52,935 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-01-12 16:04:53,107 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-01-12 16:04:53,294 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-12 16:04:53,635 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-12 16:04:54,901 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-01-12 16:04:55,045 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-01-12 16:04:55,405 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-01-12 16:04:55,646 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-12 16:04:56,198 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-01-12 16:04:56,590 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-01-12 16:04:56,930 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-12 16:04:57,335 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-01-12 16:04:57,569 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-12 16:04:57,783 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-01-12 16:04:58,278 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 16:04:58,463 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-01-12 16:04:58,967 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-01-12 16:04:59,301 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-01-12 16:04:59,477 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-01-12 16:04:59,748 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-01-12 16:05:00,128 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-01-12 16:05:00,760 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-01-12 16:05:00,964 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-01-12 16:05:01,343 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-01-12 16:05:01,609 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-01-12 16:05:01,876 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-01-12 16:05:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:09,265 INFO L93 Difference]: Finished difference Result 27953 states and 31416 transitions. [2019-01-12 16:05:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-12 16:05:09,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 123 [2019-01-12 16:05:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:09,283 INFO L225 Difference]: With dead ends: 27953 [2019-01-12 16:05:09,283 INFO L226 Difference]: Without dead ends: 20009 [2019-01-12 16:05:09,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1420, Invalid=8086, Unknown=0, NotChecked=0, Total=9506 [2019-01-12 16:05:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20009 states. [2019-01-12 16:05:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20009 to 17477. [2019-01-12 16:05:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17477 states. [2019-01-12 16:05:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17477 states to 17477 states and 19600 transitions. [2019-01-12 16:05:15,635 INFO L78 Accepts]: Start accepts. Automaton has 17477 states and 19600 transitions. Word has length 123 [2019-01-12 16:05:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:15,635 INFO L480 AbstractCegarLoop]: Abstraction has 17477 states and 19600 transitions. [2019-01-12 16:05:15,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 16:05:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 17477 states and 19600 transitions. [2019-01-12 16:05:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 16:05:15,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:15,640 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:05:15,640 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1083043294, now seen corresponding path program 1 times [2019-01-12 16:05:15,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:15,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 16:05:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:16,063 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-01-12 16:05:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 103 proven. 129 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 16:05:16,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:05:16,371 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 16:05:16,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:16,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:05:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 152 proven. 21 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 16:05:16,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:05:16,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2019-01-12 16:05:16,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 16:05:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 16:05:16,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-01-12 16:05:16,952 INFO L87 Difference]: Start difference. First operand 17477 states and 19600 transitions. Second operand 27 states. [2019-01-12 16:05:17,323 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 16:05:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:30,880 INFO L93 Difference]: Finished difference Result 29583 states and 33169 transitions. [2019-01-12 16:05:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 16:05:30,880 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 148 [2019-01-12 16:05:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:30,909 INFO L225 Difference]: With dead ends: 29583 [2019-01-12 16:05:30,909 INFO L226 Difference]: Without dead ends: 28462 [2019-01-12 16:05:30,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=542, Invalid=2320, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 16:05:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28462 states. [2019-01-12 16:05:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28462 to 18524. [2019-01-12 16:05:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2019-01-12 16:05:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 20756 transitions. [2019-01-12 16:05:37,890 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 20756 transitions. Word has length 148 [2019-01-12 16:05:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:37,890 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 20756 transitions. [2019-01-12 16:05:37,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 16:05:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 20756 transitions. [2019-01-12 16:05:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 16:05:37,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:37,895 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:05:37,895 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2044509292, now seen corresponding path program 1 times [2019-01-12 16:05:37,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:37,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:37,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:37,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 16:05:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 16:05:38,004 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 16:05:38,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:05:38 BoogieIcfgContainer [2019-01-12 16:05:38,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 16:05:38,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 16:05:38,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 16:05:38,188 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 16:05:38,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:54:07" (3/4) ... [2019-01-12 16:05:38,197 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 16:05:38,380 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 16:05:38,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 16:05:38,383 INFO L168 Benchmark]: Toolchain (without parser) took 692237.06 ms. Allocated memory was 1.0 GB in the beginning and 5.7 GB in the end (delta: 4.7 GB). Free memory was 954.0 MB in the beginning and 1.4 GB in the end (delta: -396.3 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-01-12 16:05:38,384 INFO L168 Benchmark]: CDTParser took 0.18 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 16:05:38,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 936.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-01-12 16:05:38,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-12 16:05:38,385 INFO L168 Benchmark]: Boogie Preprocessor took 37.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 16:05:38,385 INFO L168 Benchmark]: RCFGBuilder took 942.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-01-12 16:05:38,385 INFO L168 Benchmark]: TraceAbstraction took 690416.87 ms. Allocated memory was 1.2 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.6 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-01-12 16:05:38,385 INFO L168 Benchmark]: Witness Printer took 193.26 ms. Allocated memory is still 5.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 80.3 MB). Peak memory consumption was 80.3 MB. Max. memory is 11.5 GB. [2019-01-12 16:05:38,386 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.18 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 502.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 936.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 942.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 690416.87 ms. Allocated memory was 1.2 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.6 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 193.26 ms. Allocated memory is still 5.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 80.3 MB). Peak memory consumption was 80.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 352]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] char r1 ; [L72] port_t p1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L77] msg_t send1 ; [L78] _Bool mode1 ; [L79] _Bool alive1 ; [L80] port_t p2 ; [L81] char p2_old ; [L82] char p2_new ; [L83] char id2 ; [L84] char st2 ; [L85] msg_t send2 ; [L86] _Bool mode2 ; [L87] _Bool alive2 ; [L88] port_t p3 ; [L89] char p3_old ; [L90] char p3_new ; [L91] char id3 ; [L92] char st3 ; [L93] msg_t send3 ; [L94] _Bool mode3 ; [L95] _Bool alive3 ; [L196] void (*nodes[3])(void) = { & node1, & node2, & node3}; VAL [alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L296] int c1 ; [L297] int i2 ; [L300] c1 = 0 [L301] r1 = __VERIFIER_nondet_char() [L302] id1 = __VERIFIER_nondet_char() [L303] st1 = __VERIFIER_nondet_char() [L304] send1 = __VERIFIER_nondet_char() [L305] mode1 = __VERIFIER_nondet_bool() [L306] alive1 = __VERIFIER_nondet_bool() [L307] id2 = __VERIFIER_nondet_char() [L308] st2 = __VERIFIER_nondet_char() [L309] send2 = __VERIFIER_nondet_char() [L310] mode2 = __VERIFIER_nondet_bool() [L311] alive2 = __VERIFIER_nondet_bool() [L312] id3 = __VERIFIER_nondet_char() [L313] st3 = __VERIFIER_nondet_char() [L314] send3 = __VERIFIER_nondet_char() [L315] mode3 = __VERIFIER_nondet_bool() [L316] alive3 = __VERIFIER_nondet_bool() [L199] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L202] COND TRUE (int )r1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L203] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L206] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L207] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L209] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L211] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L213] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L215] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L216] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L217] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE (int )id2 != (int )id3 [L219] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L271] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L317] i2 = init() [L319] p1_old = nomsg [L320] p1_new = nomsg [L321] p2_old = nomsg [L322] p2_new = nomsg [L323] p3_old = nomsg [L324] p3_new = nomsg [L325] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L283] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L286] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L352] __VERIFIER_error() VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 1 error locations. UNSAFE Result, 690.3s OverallTime, 41 OverallIterations, 6 TraceHistogramMax, 505.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7406 SDtfs, 40338 SDslu, 74811 SDs, 0 SdLazy, 34199 SolverSat, 2931 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4037 GetRequests, 1910 SyntacticMatches, 12 SemanticMatches, 2115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234532 ImplicationChecksByTransitivity, 236.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91633occurred in iteration=28, 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: 153.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 514874 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 27.2s InterpolantComputationTime, 5408 NumberOfCodeBlocks, 5408 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 5200 ConstructedInterpolants, 520 QuantifiedInterpolants, 6354599 SizeOfPredicates, 93 NumberOfNonLiveVariables, 7896 ConjunctsInSsa, 377 ConjunctsInUnsatCore, 60 InterpolantComputations, 20 PerfectInterpolantSequences, 1706/3101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...