./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.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.3_false-unreach-call.1.ufo.UNBOUNDED.pals.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 d554aa2ddd753c54eae3eaa938a78036ee261f5c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 16:05:05,754 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 16:05:05,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 16:05:05,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 16:05:05,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 16:05:05,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 16:05:05,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 16:05:05,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 16:05:05,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 16:05:05,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 16:05:05,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 16:05:05,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 16:05:05,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 16:05:05,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 16:05:05,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 16:05:05,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 16:05:05,786 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 16:05:05,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 16:05:05,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 16:05:05,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 16:05:05,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 16:05:05,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 16:05:05,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 16:05:05,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 16:05:05,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 16:05:05,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 16:05:05,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 16:05:05,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 16:05:05,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 16:05:05,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 16:05:05,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 16:05:05,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 16:05:05,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 16:05:05,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 16:05:05,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 16:05:05,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 16:05:05,814 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 16:05:05,835 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 16:05:05,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 16:05:05,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 16:05:05,838 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 16:05:05,838 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 16:05:05,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 16:05:05,838 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 16:05:05,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 16:05:05,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 16:05:05,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 16:05:05,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 16:05:05,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 16:05:05,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 16:05:05,844 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 16:05:05,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 16:05:05,845 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 16:05:05,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 16:05:05,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 16:05:05,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 16:05:05,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 16:05:05,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 16:05:05,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 16:05:05,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 16:05:05,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 16:05:05,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 16:05:05,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 16:05:05,850 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 16:05:05,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 16:05:05,850 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 -> d554aa2ddd753c54eae3eaa938a78036ee261f5c [2019-01-12 16:05:05,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 16:05:05,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 16:05:05,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 16:05:05,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 16:05:05,946 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 16:05:05,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2019-01-12 16:05:05,996 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b367f80e/1e1b4a455bcd4f8fa4b668dc65935ba1/FLAG0ac042c54 [2019-01-12 16:05:06,411 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 16:05:06,412 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2019-01-12 16:05:06,429 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b367f80e/1e1b4a455bcd4f8fa4b668dc65935ba1/FLAG0ac042c54 [2019-01-12 16:05:06,767 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b367f80e/1e1b4a455bcd4f8fa4b668dc65935ba1 [2019-01-12 16:05:06,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 16:05:06,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 16:05:06,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 16:05:06,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 16:05:06,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 16:05:06,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:05:06" (1/1) ... [2019-01-12 16:05:06,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e6575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:06, skipping insertion in model container [2019-01-12 16:05:06,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:05:06" (1/1) ... [2019-01-12 16:05:06,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 16:05:06,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 16:05:07,039 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 16:05:07,049 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 16:05:07,098 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 16:05:07,115 INFO L195 MainTranslator]: Completed translation [2019-01-12 16:05:07,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07 WrapperNode [2019-01-12 16:05:07,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 16:05:07,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 16:05:07,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 16:05:07,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 16:05:07,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 16:05:07,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 16:05:07,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 16:05:07,229 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 16:05:07,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (1/1) ... [2019-01-12 16:05:07,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 16:05:07,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 16:05:07,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 16:05:07,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 16:05:07,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (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 16:05:07,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 16:05:07,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 16:05:07,997 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 16:05:07,997 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-12 16:05:07,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:05:07 BoogieIcfgContainer [2019-01-12 16:05:07,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 16:05:08,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 16:05:08,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 16:05:08,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 16:05:08,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:05:06" (1/3) ... [2019-01-12 16:05:08,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf6641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:05:08, skipping insertion in model container [2019-01-12 16:05:08,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:05:07" (2/3) ... [2019-01-12 16:05:08,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf6641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:05:08, skipping insertion in model container [2019-01-12 16:05:08,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:05:07" (3/3) ... [2019-01-12 16:05:08,007 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2019-01-12 16:05:08,017 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 16:05:08,026 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 16:05:08,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 16:05:08,076 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 16:05:08,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 16:05:08,077 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 16:05:08,077 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 16:05:08,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 16:05:08,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 16:05:08,078 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 16:05:08,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 16:05:08,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 16:05:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-01-12 16:05:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 16:05:08,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:08,104 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 16:05:08,106 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:08,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:08,110 INFO L82 PathProgramCache]: Analyzing trace with hash -601603670, now seen corresponding path program 1 times [2019-01-12 16:05:08,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:08,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:08,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:08,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:08,378 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 16:05:08,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:08,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 16:05:08,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 16:05:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 16:05:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 16:05:08,399 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2019-01-12 16:05:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:08,636 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2019-01-12 16:05:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 16:05:08,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-12 16:05:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:08,649 INFO L225 Difference]: With dead ends: 100 [2019-01-12 16:05:08,649 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 16:05:08,652 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 16:05:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 16:05:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-12 16:05:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 16:05:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2019-01-12 16:05:08,689 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 23 [2019-01-12 16:05:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:08,689 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2019-01-12 16:05:08,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 16:05:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2019-01-12 16:05:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 16:05:08,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:08,692 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] [2019-01-12 16:05:08,692 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:08,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2121773305, now seen corresponding path program 1 times [2019-01-12 16:05:08,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:08,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:08,853 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 16:05:08,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:08,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:05:08,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:05:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:05:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:05:08,859 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 3 states. [2019-01-12 16:05:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:08,926 INFO L93 Difference]: Finished difference Result 125 states and 184 transitions. [2019-01-12 16:05:08,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:05:08,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-12 16:05:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:08,930 INFO L225 Difference]: With dead ends: 125 [2019-01-12 16:05:08,930 INFO L226 Difference]: Without dead ends: 88 [2019-01-12 16:05:08,931 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:05:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-12 16:05:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-01-12 16:05:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-12 16:05:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2019-01-12 16:05:08,946 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 38 [2019-01-12 16:05:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:08,947 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2019-01-12 16:05:08,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:05:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2019-01-12 16:05:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 16:05:08,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:08,950 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] [2019-01-12 16:05:08,950 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1783980163, now seen corresponding path program 1 times [2019-01-12 16:05:08,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:08,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:08,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:08,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:08,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:09,096 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 16:05:09,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:09,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:05:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:05:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:05:09,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:05:09,098 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand 3 states. [2019-01-12 16:05:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:09,158 INFO L93 Difference]: Finished difference Result 206 states and 312 transitions. [2019-01-12 16:05:09,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:05:09,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-12 16:05:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:09,161 INFO L225 Difference]: With dead ends: 206 [2019-01-12 16:05:09,161 INFO L226 Difference]: Without dead ends: 140 [2019-01-12 16:05:09,163 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:05:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-12 16:05:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-01-12 16:05:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-12 16:05:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 205 transitions. [2019-01-12 16:05:09,180 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 205 transitions. Word has length 38 [2019-01-12 16:05:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:09,181 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 205 transitions. [2019-01-12 16:05:09,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:05:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 205 transitions. [2019-01-12 16:05:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 16:05:09,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:09,183 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] [2019-01-12 16:05:09,183 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash -565994765, now seen corresponding path program 1 times [2019-01-12 16:05:09,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:09,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:09,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:09,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:09,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:09,459 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 16:05:09,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:09,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 16:05:09,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 16:05:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 16:05:09,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 16:05:09,461 INFO L87 Difference]: Start difference. First operand 138 states and 205 transitions. Second operand 7 states. [2019-01-12 16:05:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:09,894 INFO L93 Difference]: Finished difference Result 418 states and 639 transitions. [2019-01-12 16:05:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 16:05:09,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-01-12 16:05:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:09,899 INFO L225 Difference]: With dead ends: 418 [2019-01-12 16:05:09,899 INFO L226 Difference]: Without dead ends: 300 [2019-01-12 16:05:09,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-12 16:05:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-12 16:05:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 254. [2019-01-12 16:05:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-12 16:05:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2019-01-12 16:05:09,948 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 38 [2019-01-12 16:05:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:09,948 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2019-01-12 16:05:09,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 16:05:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2019-01-12 16:05:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 16:05:09,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:09,952 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] [2019-01-12 16:05:09,952 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash 455073589, now seen corresponding path program 1 times [2019-01-12 16:05:09,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:09,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:10,217 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 16:05:10,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:10,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 16:05:10,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 16:05:10,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 16:05:10,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 16:05:10,220 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand 5 states. [2019-01-12 16:05:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:10,993 INFO L93 Difference]: Finished difference Result 1658 states and 2575 transitions. [2019-01-12 16:05:10,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 16:05:10,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-01-12 16:05:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:11,005 INFO L225 Difference]: With dead ends: 1658 [2019-01-12 16:05:11,006 INFO L226 Difference]: Without dead ends: 1424 [2019-01-12 16:05:11,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 16:05:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2019-01-12 16:05:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 486. [2019-01-12 16:05:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-01-12 16:05:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 733 transitions. [2019-01-12 16:05:11,079 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 733 transitions. Word has length 38 [2019-01-12 16:05:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:11,080 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 733 transitions. [2019-01-12 16:05:11,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 16:05:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 733 transitions. [2019-01-12 16:05:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 16:05:11,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:11,082 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 16:05:11,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:11,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2110152403, now seen corresponding path program 1 times [2019-01-12 16:05:11,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:11,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:11,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:11,309 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-12 16:05:11,404 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 16:05:11,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 16:05:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 16:05:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 16:05:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 16:05:11,407 INFO L87 Difference]: Start difference. First operand 486 states and 733 transitions. Second operand 5 states. [2019-01-12 16:05:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:11,779 INFO L93 Difference]: Finished difference Result 1420 states and 2160 transitions. [2019-01-12 16:05:11,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 16:05:11,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-01-12 16:05:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:11,790 INFO L225 Difference]: With dead ends: 1420 [2019-01-12 16:05:11,791 INFO L226 Difference]: Without dead ends: 954 [2019-01-12 16:05:11,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 16:05:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-01-12 16:05:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 718. [2019-01-12 16:05:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-01-12 16:05:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1073 transitions. [2019-01-12 16:05:11,880 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1073 transitions. Word has length 40 [2019-01-12 16:05:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:11,880 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 1073 transitions. [2019-01-12 16:05:11,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 16:05:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1073 transitions. [2019-01-12 16:05:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 16:05:11,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:11,889 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 16:05:11,890 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:11,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2118321381, now seen corresponding path program 1 times [2019-01-12 16:05:11,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:11,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:11,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:12,038 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 16:05:12,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:05:12,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:05:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:05:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:05:12,046 INFO L87 Difference]: Start difference. First operand 718 states and 1073 transitions. Second operand 3 states. [2019-01-12 16:05:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:12,311 INFO L93 Difference]: Finished difference Result 1702 states and 2539 transitions. [2019-01-12 16:05:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:05:12,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-12 16:05:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:12,319 INFO L225 Difference]: With dead ends: 1702 [2019-01-12 16:05:12,320 INFO L226 Difference]: Without dead ends: 1004 [2019-01-12 16:05:12,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:05:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-01-12 16:05:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 990. [2019-01-12 16:05:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-01-12 16:05:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1441 transitions. [2019-01-12 16:05:12,420 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1441 transitions. Word has length 40 [2019-01-12 16:05:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:12,420 INFO L480 AbstractCegarLoop]: Abstraction has 990 states and 1441 transitions. [2019-01-12 16:05:12,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:05:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1441 transitions. [2019-01-12 16:05:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 16:05:12,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:12,423 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 16:05:12,423 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:12,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:12,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1404938256, now seen corresponding path program 1 times [2019-01-12 16:05:12,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:12,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:12,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:12,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:12,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:12,580 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 16:05:12,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:12,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 16:05:12,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 16:05:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 16:05:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 16:05:12,583 INFO L87 Difference]: Start difference. First operand 990 states and 1441 transitions. Second operand 7 states. [2019-01-12 16:05:13,073 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 16:05:13,294 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 16:05:13,532 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 16:05:14,071 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 16:05:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:14,295 INFO L93 Difference]: Finished difference Result 1943 states and 2795 transitions. [2019-01-12 16:05:14,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 16:05:14,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-12 16:05:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:14,308 INFO L225 Difference]: With dead ends: 1943 [2019-01-12 16:05:14,308 INFO L226 Difference]: Without dead ends: 1941 [2019-01-12 16:05:14,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-12 16:05:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2019-01-12 16:05:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1074. [2019-01-12 16:05:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-01-12 16:05:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1521 transitions. [2019-01-12 16:05:14,445 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1521 transitions. Word has length 41 [2019-01-12 16:05:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:14,445 INFO L480 AbstractCegarLoop]: Abstraction has 1074 states and 1521 transitions. [2019-01-12 16:05:14,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 16:05:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1521 transitions. [2019-01-12 16:05:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-12 16:05:14,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:14,446 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 16:05:14,447 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash -990766588, now seen corresponding path program 1 times [2019-01-12 16:05:14,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:14,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:14,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:14,528 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 16:05:14,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:14,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:05:14,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:05:14,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:05:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:05:14,529 INFO L87 Difference]: Start difference. First operand 1074 states and 1521 transitions. Second operand 3 states. [2019-01-12 16:05:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:14,765 INFO L93 Difference]: Finished difference Result 2425 states and 3475 transitions. [2019-01-12 16:05:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:05:14,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-12 16:05:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:14,775 INFO L225 Difference]: With dead ends: 2425 [2019-01-12 16:05:14,776 INFO L226 Difference]: Without dead ends: 1654 [2019-01-12 16:05:14,778 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:05:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2019-01-12 16:05:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1652. [2019-01-12 16:05:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-01-12 16:05:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2323 transitions. [2019-01-12 16:05:14,947 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2323 transitions. Word has length 42 [2019-01-12 16:05:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:14,947 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 2323 transitions. [2019-01-12 16:05:14,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:05:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2323 transitions. [2019-01-12 16:05:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 16:05:14,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:14,951 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] [2019-01-12 16:05:14,951 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:14,951 INFO L82 PathProgramCache]: Analyzing trace with hash -86393464, now seen corresponding path program 1 times [2019-01-12 16:05:14,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:14,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:14,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:14,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:14,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:15,172 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 16:05:15,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:05:15,173 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 16:05:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:15,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:05:15,391 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 16:05:15,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 16:05:15,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-01-12 16:05:15,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 16:05:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 16:05:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 16:05:15,423 INFO L87 Difference]: Start difference. First operand 1652 states and 2323 transitions. Second operand 8 states. [2019-01-12 16:05:15,863 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 16:05:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:17,637 INFO L93 Difference]: Finished difference Result 6724 states and 9631 transitions. [2019-01-12 16:05:17,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 16:05:17,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-01-12 16:05:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:17,669 INFO L225 Difference]: With dead ends: 6724 [2019-01-12 16:05:17,669 INFO L226 Difference]: Without dead ends: 5634 [2019-01-12 16:05:17,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-12 16:05:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5634 states. [2019-01-12 16:05:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5634 to 2188. [2019-01-12 16:05:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-01-12 16:05:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3095 transitions. [2019-01-12 16:05:17,989 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3095 transitions. Word has length 60 [2019-01-12 16:05:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:17,990 INFO L480 AbstractCegarLoop]: Abstraction has 2188 states and 3095 transitions. [2019-01-12 16:05:17,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 16:05:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3095 transitions. [2019-01-12 16:05:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 16:05:17,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:17,994 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] [2019-01-12 16:05:17,994 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1855176280, now seen corresponding path program 1 times [2019-01-12 16:05:17,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:17,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:17,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:17,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 16:05:18,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:18,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 16:05:18,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 16:05:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 16:05:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 16:05:18,318 INFO L87 Difference]: Start difference. First operand 2188 states and 3095 transitions. Second operand 5 states. [2019-01-12 16:05:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:19,280 INFO L93 Difference]: Finished difference Result 6252 states and 8955 transitions. [2019-01-12 16:05:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 16:05:19,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-01-12 16:05:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:19,307 INFO L225 Difference]: With dead ends: 6252 [2019-01-12 16:05:19,308 INFO L226 Difference]: Without dead ends: 4626 [2019-01-12 16:05:19,312 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 16:05:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-01-12 16:05:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 3276. [2019-01-12 16:05:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-01-12 16:05:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4639 transitions. [2019-01-12 16:05:19,733 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4639 transitions. Word has length 60 [2019-01-12 16:05:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:19,734 INFO L480 AbstractCegarLoop]: Abstraction has 3276 states and 4639 transitions. [2019-01-12 16:05:19,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 16:05:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4639 transitions. [2019-01-12 16:05:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 16:05:19,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:19,738 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] [2019-01-12 16:05:19,738 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1793215859, now seen corresponding path program 1 times [2019-01-12 16:05:19,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:19,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:19,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:19,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:19,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:19,902 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 16:05:19,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:05:19,902 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 16:05:19,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:19,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:05:20,192 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 16:05:20,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 16:05:20,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-01-12 16:05:20,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 16:05:20,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 16:05:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 16:05:20,212 INFO L87 Difference]: Start difference. First operand 3276 states and 4639 transitions. Second operand 8 states. [2019-01-12 16:05:20,535 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 16:05:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:21,495 INFO L93 Difference]: Finished difference Result 8860 states and 12727 transitions. [2019-01-12 16:05:21,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 16:05:21,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-01-12 16:05:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:21,526 INFO L225 Difference]: With dead ends: 8860 [2019-01-12 16:05:21,526 INFO L226 Difference]: Without dead ends: 7514 [2019-01-12 16:05:21,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-12 16:05:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7514 states. [2019-01-12 16:05:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7514 to 3724. [2019-01-12 16:05:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2019-01-12 16:05:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 5291 transitions. [2019-01-12 16:05:21,953 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 5291 transitions. Word has length 62 [2019-01-12 16:05:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:21,954 INFO L480 AbstractCegarLoop]: Abstraction has 3724 states and 5291 transitions. [2019-01-12 16:05:21,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 16:05:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 5291 transitions. [2019-01-12 16:05:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 16:05:21,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:21,957 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 16:05:21,957 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1526019776, now seen corresponding path program 1 times [2019-01-12 16:05:21,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:21,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:21,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:05:22,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:05:22,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:05:22,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:05:22,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:05:22,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:05:22,052 INFO L87 Difference]: Start difference. First operand 3724 states and 5291 transitions. Second operand 3 states. [2019-01-12 16:05:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:22,332 INFO L93 Difference]: Finished difference Result 6885 states and 9833 transitions. [2019-01-12 16:05:22,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:05:22,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-01-12 16:05:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:22,342 INFO L225 Difference]: With dead ends: 6885 [2019-01-12 16:05:22,342 INFO L226 Difference]: Without dead ends: 3183 [2019-01-12 16:05:22,348 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:05:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2019-01-12 16:05:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3181. [2019-01-12 16:05:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-01-12 16:05:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4506 transitions. [2019-01-12 16:05:22,757 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4506 transitions. Word has length 62 [2019-01-12 16:05:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:22,757 INFO L480 AbstractCegarLoop]: Abstraction has 3181 states and 4506 transitions. [2019-01-12 16:05:22,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:05:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4506 transitions. [2019-01-12 16:05:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 16:05:22,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:22,760 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 16:05:22,760 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash 63918561, now seen corresponding path program 1 times [2019-01-12 16:05:22,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:22,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:22,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:22,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:22,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:23,147 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 12 [2019-01-12 16:05:23,204 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 16:05:23,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:05:23,205 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 16:05:23,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:23,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:05:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 16:05:23,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:05:23,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-01-12 16:05:23,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 16:05:23,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 16:05:23,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 16:05:23,390 INFO L87 Difference]: Start difference. First operand 3181 states and 4506 transitions. Second operand 10 states. [2019-01-12 16:05:23,949 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-12 16:05:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:05:28,652 INFO L93 Difference]: Finished difference Result 20188 states and 28050 transitions. [2019-01-12 16:05:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 16:05:28,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-01-12 16:05:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:05:28,684 INFO L225 Difference]: With dead ends: 20188 [2019-01-12 16:05:28,684 INFO L226 Difference]: Without dead ends: 17050 [2019-01-12 16:05:28,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=427, Invalid=1643, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 16:05:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17050 states. [2019-01-12 16:05:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17050 to 10184. [2019-01-12 16:05:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10184 states. [2019-01-12 16:05:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10184 states to 10184 states and 13952 transitions. [2019-01-12 16:05:29,852 INFO L78 Accepts]: Start accepts. Automaton has 10184 states and 13952 transitions. Word has length 63 [2019-01-12 16:05:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:05:29,853 INFO L480 AbstractCegarLoop]: Abstraction has 10184 states and 13952 transitions. [2019-01-12 16:05:29,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 16:05:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 10184 states and 13952 transitions. [2019-01-12 16:05:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 16:05:29,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:05:29,857 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] [2019-01-12 16:05:29,857 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:05:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:05:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 61281861, now seen corresponding path program 1 times [2019-01-12 16:05:29,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:05:29,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:05:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:29,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:05:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:05:30,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:05:30,134 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 16:05:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:05:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:05:30,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:05:31,004 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 16:05:31,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:05:31,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2019-01-12 16:05:31,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 16:05:31,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 16:05:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-01-12 16:05:31,027 INFO L87 Difference]: Start difference. First operand 10184 states and 13952 transitions. Second operand 20 states. [2019-01-12 16:05:31,602 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-12 16:05:31,814 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-01-12 16:05:32,117 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-12 16:05:32,345 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-12 16:05:32,670 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-01-12 16:05:32,987 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-01-12 16:05:33,354 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-01-12 16:05:33,675 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-01-12 16:05:34,020 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-01-12 16:05:34,416 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-01-12 16:05:34,716 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 16:05:35,041 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-01-12 16:05:35,419 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-01-12 16:05:35,832 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-01-12 16:05:36,253 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-12 16:05:36,650 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-01-12 16:05:36,953 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-01-12 16:05:37,359 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-12 16:05:37,813 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-12 16:05:38,102 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-01-12 16:05:38,588 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-01-12 16:05:38,966 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-01-12 16:05:39,351 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-01-12 16:05:39,882 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-01-12 16:05:40,341 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-01-12 16:05:40,710 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-01-12 16:05:41,039 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-01-12 16:05:41,383 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-01-12 16:05:41,678 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-12 16:05:41,960 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-01-12 16:05:42,247 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-01-12 16:05:42,534 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-01-12 16:05:42,893 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-01-12 16:05:43,170 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-12 16:05:43,464 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 16:05:43,834 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-12 16:05:44,173 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-01-12 16:05:44,519 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-01-12 16:05:44,839 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-01-12 16:05:45,170 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-12 16:05:45,583 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-01-12 16:05:45,981 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-01-12 16:05:46,268 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-01-12 16:05:46,460 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-12 16:05:46,883 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-01-12 16:05:47,185 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-01-12 16:05:47,414 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:05:47,819 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-12 16:05:48,035 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-01-12 16:05:48,443 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-12 16:05:49,133 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-12 16:05:49,427 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 16:05:49,779 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-01-12 16:05:50,031 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:05:50,291 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-12 16:05:50,632 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-12 16:05:50,910 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-12 16:05:51,163 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-12 16:05:51,479 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-01-12 16:05:51,751 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-12 16:05:52,557 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-01-12 16:05:52,792 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-12 16:05:53,159 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-01-12 16:05:53,461 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-01-12 16:05:53,773 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-01-12 16:05:54,140 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-01-12 16:05:54,460 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-12 16:05:54,757 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-12 16:05:55,102 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-12 16:05:55,421 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-12 16:05:55,763 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-01-12 16:05:56,071 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-12 16:05:56,298 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-12 16:05:56,493 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:05:56,812 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-01-12 16:05:57,233 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-01-12 16:05:57,442 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-12 16:05:57,671 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-01-12 16:05:57,874 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-12 16:05:58,240 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-01-12 16:05:58,524 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-01-12 16:05:58,824 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-12 16:05:59,351 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-12 16:05:59,588 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-01-12 16:05:59,770 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:00,092 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-12 16:06:00,505 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-01-12 16:06:00,955 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:01,177 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-01-12 16:06:01,856 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:02,222 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-01-12 16:06:02,567 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-12 16:06:02,981 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:06:03,194 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-01-12 16:06:03,514 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 16:06:04,294 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-01-12 16:06:04,466 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:06:04,812 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:06:05,078 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-12 16:06:05,549 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-01-12 16:06:05,742 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:06:06,243 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:06:06,542 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-12 16:06:06,946 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:06:08,416 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-12 16:06:08,706 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-01-12 16:06:08,866 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-01-12 16:06:09,085 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-01-12 16:06:09,394 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-12 16:06:09,720 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-01-12 16:06:09,952 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-01-12 16:06:10,243 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-01-12 16:06:10,456 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-01-12 16:06:10,681 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-01-12 16:06:10,967 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:11,287 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:06:11,517 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:11,718 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-12 16:06:11,903 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-12 16:06:12,300 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-12 16:06:12,521 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-12 16:06:12,818 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-12 16:06:13,113 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-12 16:06:13,678 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 16:06:13,892 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-12 16:06:14,105 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-12 16:06:14,670 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-01-12 16:06:14,906 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-01-12 16:06:15,419 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:06:15,650 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:16,327 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-01-12 16:06:16,588 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-12 16:06:16,798 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-01-12 16:06:17,120 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-12 16:06:17,467 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-12 16:06:17,671 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-12 16:06:17,954 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-01-12 16:06:18,166 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-01-12 16:06:18,521 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 16:06:18,847 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-01-12 16:06:19,679 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-12 16:06:19,905 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-01-12 16:06:20,215 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-12 16:06:20,551 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-12 16:06:20,911 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-12 16:06:22,521 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 16:06:22,789 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-01-12 16:06:23,396 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:23,603 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-01-12 16:06:23,797 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-01-12 16:06:24,057 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-12 16:06:24,350 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 16:06:24,868 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-12 16:06:25,158 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-12 16:06:25,582 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-12 16:06:25,733 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-12 16:06:26,032 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-12 16:06:26,199 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-01-12 16:06:26,520 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-01-12 16:06:26,750 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-12 16:06:27,068 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 16:06:27,269 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 16:06:27,712 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-12 16:06:27,885 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-01-12 16:06:28,217 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-01-12 16:06:28,577 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-12 16:06:28,982 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:06:29,222 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-12 16:06:29,712 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-12 16:06:29,992 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:06:30,412 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-12 16:06:30,780 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-12 16:06:31,009 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-12 16:06:31,467 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-12 16:06:31,851 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 16:06:32,153 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-12 16:06:32,514 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-01-12 16:06:32,800 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-01-12 16:06:33,154 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-12 16:06:34,092 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-12 16:06:34,383 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-01-12 16:06:35,018 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-01-12 16:06:35,244 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-01-12 16:06:35,550 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-01-12 16:06:36,131 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-01-12 16:06:36,324 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:06:36,579 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-12 16:06:37,011 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-01-12 16:06:37,451 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-12 16:06:37,759 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-12 16:06:38,115 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-12 16:06:38,311 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 16:06:38,589 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-12 16:06:38,977 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:06:39,187 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:06:39,433 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 16:06:39,764 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-12 16:06:40,817 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:06:41,201 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-01-12 16:06:42,467 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:06:42,899 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-12 16:06:43,157 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-12 16:06:43,512 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-12 16:06:43,739 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-01-12 16:06:44,259 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-12 16:06:44,587 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-12 16:06:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:06:45,644 INFO L93 Difference]: Finished difference Result 77357 states and 106781 transitions. [2019-01-12 16:06:45,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 283 states. [2019-01-12 16:06:45,645 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2019-01-12 16:06:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:06:45,776 INFO L225 Difference]: With dead ends: 77357 [2019-01-12 16:06:45,776 INFO L226 Difference]: Without dead ends: 68560 [2019-01-12 16:06:45,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41656 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=9813, Invalid=79289, Unknown=0, NotChecked=0, Total=89102 [2019-01-12 16:06:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68560 states. [2019-01-12 16:06:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68560 to 20809. [2019-01-12 16:06:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20809 states. [2019-01-12 16:06:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20809 states to 20809 states and 28892 transitions. [2019-01-12 16:06:50,058 INFO L78 Accepts]: Start accepts. Automaton has 20809 states and 28892 transitions. Word has length 64 [2019-01-12 16:06:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:06:50,059 INFO L480 AbstractCegarLoop]: Abstraction has 20809 states and 28892 transitions. [2019-01-12 16:06:50,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 16:06:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 20809 states and 28892 transitions. [2019-01-12 16:06:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 16:06:50,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:06:50,063 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2019-01-12 16:06:50,063 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:06:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:06:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash -974059429, now seen corresponding path program 1 times [2019-01-12 16:06:50,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:06:50,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:06:50,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:06:50,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:06:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:06:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:06:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:06:50,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:06:50,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:06:50,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:06:50,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:06:50,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:06:50,146 INFO L87 Difference]: Start difference. First operand 20809 states and 28892 transitions. Second operand 3 states. [2019-01-12 16:06:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:06:52,207 INFO L93 Difference]: Finished difference Result 30722 states and 42723 transitions. [2019-01-12 16:06:52,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:06:52,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-12 16:06:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:06:52,220 INFO L225 Difference]: With dead ends: 30722 [2019-01-12 16:06:52,221 INFO L226 Difference]: Without dead ends: 10575 [2019-01-12 16:06:52,241 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:06:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10575 states. [2019-01-12 16:06:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10575 to 10384. [2019-01-12 16:06:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-01-12 16:06:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 14121 transitions. [2019-01-12 16:06:54,053 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 14121 transitions. Word has length 64 [2019-01-12 16:06:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:06:54,053 INFO L480 AbstractCegarLoop]: Abstraction has 10384 states and 14121 transitions. [2019-01-12 16:06:54,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:06:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 14121 transitions. [2019-01-12 16:06:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 16:06:54,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:06:54,054 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] [2019-01-12 16:06:54,055 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:06:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:06:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash 38685603, now seen corresponding path program 1 times [2019-01-12 16:06:54,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:06:54,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:06:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:06:54,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:06:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:06:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:06:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 16:06:54,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:06:54,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 16:06:54,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 16:06:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 16:06:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 16:06:54,452 INFO L87 Difference]: Start difference. First operand 10384 states and 14121 transitions. Second operand 6 states. [2019-01-12 16:06:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:06:55,932 INFO L93 Difference]: Finished difference Result 18784 states and 25540 transitions. [2019-01-12 16:06:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 16:06:55,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-12 16:06:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:06:55,941 INFO L225 Difference]: With dead ends: 18784 [2019-01-12 16:06:55,941 INFO L226 Difference]: Without dead ends: 8504 [2019-01-12 16:06:55,949 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 16:06:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8504 states. [2019-01-12 16:06:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8504 to 8483. [2019-01-12 16:06:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8483 states. [2019-01-12 16:06:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 11318 transitions. [2019-01-12 16:06:57,325 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 11318 transitions. Word has length 64 [2019-01-12 16:06:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:06:57,325 INFO L480 AbstractCegarLoop]: Abstraction has 8483 states and 11318 transitions. [2019-01-12 16:06:57,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 16:06:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 11318 transitions. [2019-01-12 16:06:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 16:06:57,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:06:57,327 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 16:06:57,327 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:06:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:06:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1640573622, now seen corresponding path program 1 times [2019-01-12 16:06:57,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:06:57,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:06:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:06:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:06:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:06:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:06:57,652 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-12 16:06:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:06:57,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:06:57,771 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 16:06:57,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:06:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:06:57,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:06:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:06:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:06:58,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 24 [2019-01-12 16:06:58,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 16:06:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 16:06:58,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-01-12 16:06:58,528 INFO L87 Difference]: Start difference. First operand 8483 states and 11318 transitions. Second operand 24 states. [2019-01-12 16:06:59,719 WARN L181 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-12 16:07:00,579 WARN L181 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-01-12 16:07:04,968 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-12 16:07:06,140 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 16:07:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:12,405 INFO L93 Difference]: Finished difference Result 31444 states and 42075 transitions. [2019-01-12 16:07:12,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-12 16:07:12,406 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2019-01-12 16:07:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:12,425 INFO L225 Difference]: With dead ends: 31444 [2019-01-12 16:07:12,426 INFO L226 Difference]: Without dead ends: 23497 [2019-01-12 16:07:12,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1196, Invalid=6114, Unknown=0, NotChecked=0, Total=7310 [2019-01-12 16:07:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23497 states. [2019-01-12 16:07:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23497 to 18933. [2019-01-12 16:07:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18933 states. [2019-01-12 16:07:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18933 states to 18933 states and 25202 transitions. [2019-01-12 16:07:15,779 INFO L78 Accepts]: Start accepts. Automaton has 18933 states and 25202 transitions. Word has length 65 [2019-01-12 16:07:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:15,779 INFO L480 AbstractCegarLoop]: Abstraction has 18933 states and 25202 transitions. [2019-01-12 16:07:15,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 16:07:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 18933 states and 25202 transitions. [2019-01-12 16:07:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 16:07:15,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:15,781 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-01-12 16:07:15,781 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:15,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1083107744, now seen corresponding path program 1 times [2019-01-12 16:07:15,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:15,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:15,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:15,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:07:15,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 16:07:15,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 16:07:15,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 16:07:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 16:07:15,871 INFO L87 Difference]: Start difference. First operand 18933 states and 25202 transitions. Second operand 3 states. [2019-01-12 16:07:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:17,260 INFO L93 Difference]: Finished difference Result 24125 states and 32120 transitions. [2019-01-12 16:07:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 16:07:17,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-12 16:07:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:17,267 INFO L225 Difference]: With dead ends: 24125 [2019-01-12 16:07:17,267 INFO L226 Difference]: Without dead ends: 5771 [2019-01-12 16:07:17,278 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:07:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2019-01-12 16:07:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5769. [2019-01-12 16:07:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2019-01-12 16:07:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7451 transitions. [2019-01-12 16:07:18,354 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7451 transitions. Word has length 65 [2019-01-12 16:07:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:18,355 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 7451 transitions. [2019-01-12 16:07:18,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 16:07:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7451 transitions. [2019-01-12 16:07:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 16:07:18,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:18,356 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, 1] [2019-01-12 16:07:18,356 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash -415054404, now seen corresponding path program 1 times [2019-01-12 16:07:18,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:18,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:18,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:18,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:18,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:18,710 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2019-01-12 16:07:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:19,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:07:19,088 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 16:07:19,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:19,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:07:20,375 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 16:07:20,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:07:20,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 31 [2019-01-12 16:07:20,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 16:07:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 16:07:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-01-12 16:07:20,395 INFO L87 Difference]: Start difference. First operand 5769 states and 7451 transitions. Second operand 31 states. [2019-01-12 16:07:20,726 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-01-12 16:07:22,333 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-01-12 16:07:22,991 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-01-12 16:07:23,187 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-01-12 16:07:23,437 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-12 16:07:23,882 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 16:07:26,138 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-12 16:07:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:28,995 INFO L93 Difference]: Finished difference Result 15027 states and 19687 transitions. [2019-01-12 16:07:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-12 16:07:28,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-01-12 16:07:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:29,006 INFO L225 Difference]: With dead ends: 15027 [2019-01-12 16:07:29,006 INFO L226 Difference]: Without dead ends: 11575 [2019-01-12 16:07:29,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=858, Invalid=4842, Unknown=0, NotChecked=0, Total=5700 [2019-01-12 16:07:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11575 states. [2019-01-12 16:07:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11575 to 5599. [2019-01-12 16:07:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5599 states. [2019-01-12 16:07:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 7237 transitions. [2019-01-12 16:07:30,235 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 7237 transitions. Word has length 66 [2019-01-12 16:07:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:30,235 INFO L480 AbstractCegarLoop]: Abstraction has 5599 states and 7237 transitions. [2019-01-12 16:07:30,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 16:07:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 7237 transitions. [2019-01-12 16:07:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 16:07:30,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:30,236 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, 1] [2019-01-12 16:07:30,237 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:30,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash -809421190, now seen corresponding path program 1 times [2019-01-12 16:07:30,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:30,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:30,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 16:07:30,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:07:30,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 16:07:30,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 16:07:30,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 16:07:30,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 16:07:30,389 INFO L87 Difference]: Start difference. First operand 5599 states and 7237 transitions. Second operand 7 states. [2019-01-12 16:07:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:31,333 INFO L93 Difference]: Finished difference Result 9503 states and 12374 transitions. [2019-01-12 16:07:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 16:07:31,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-01-12 16:07:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:31,337 INFO L225 Difference]: With dead ends: 9503 [2019-01-12 16:07:31,337 INFO L226 Difference]: Without dead ends: 3961 [2019-01-12 16:07:31,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-12 16:07:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-01-12 16:07:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3871. [2019-01-12 16:07:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3871 states. [2019-01-12 16:07:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 5059 transitions. [2019-01-12 16:07:32,260 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 5059 transitions. Word has length 66 [2019-01-12 16:07:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:32,260 INFO L480 AbstractCegarLoop]: Abstraction has 3871 states and 5059 transitions. [2019-01-12 16:07:32,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 16:07:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 5059 transitions. [2019-01-12 16:07:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 16:07:32,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:32,264 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:32,265 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash -392966367, now seen corresponding path program 1 times [2019-01-12 16:07:32,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:32,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:32,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:32,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 16:07:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:07:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 16:07:32,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 16:07:32,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 16:07:32,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 16:07:32,428 INFO L87 Difference]: Start difference. First operand 3871 states and 5059 transitions. Second operand 5 states. [2019-01-12 16:07:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:33,307 INFO L93 Difference]: Finished difference Result 7033 states and 9256 transitions. [2019-01-12 16:07:33,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 16:07:33,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-01-12 16:07:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:33,312 INFO L225 Difference]: With dead ends: 7033 [2019-01-12 16:07:33,312 INFO L226 Difference]: Without dead ends: 3349 [2019-01-12 16:07:33,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 16:07:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-01-12 16:07:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 2279. [2019-01-12 16:07:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-01-12 16:07:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2929 transitions. [2019-01-12 16:07:33,895 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2929 transitions. Word has length 109 [2019-01-12 16:07:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:33,896 INFO L480 AbstractCegarLoop]: Abstraction has 2279 states and 2929 transitions. [2019-01-12 16:07:33,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 16:07:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2929 transitions. [2019-01-12 16:07:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 16:07:33,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:33,898 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:33,898 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash -816613089, now seen corresponding path program 1 times [2019-01-12 16:07:33,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:33,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:33,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:34,387 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 16:07:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 38 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:34,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:07:34,556 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 16:07:34,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:34,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:07:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 42 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:35,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:07:35,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-12 16:07:35,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 16:07:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 16:07:35,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-01-12 16:07:35,637 INFO L87 Difference]: Start difference. First operand 2279 states and 2929 transitions. Second operand 20 states. [2019-01-12 16:07:36,052 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-12 16:07:36,882 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-12 16:07:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:38,089 INFO L93 Difference]: Finished difference Result 4375 states and 5706 transitions. [2019-01-12 16:07:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 16:07:38,090 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-01-12 16:07:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:38,093 INFO L225 Difference]: With dead ends: 4375 [2019-01-12 16:07:38,093 INFO L226 Difference]: Without dead ends: 2845 [2019-01-12 16:07:38,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 16:07:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2019-01-12 16:07:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2279. [2019-01-12 16:07:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-01-12 16:07:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2916 transitions. [2019-01-12 16:07:38,738 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2916 transitions. Word has length 109 [2019-01-12 16:07:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:38,738 INFO L480 AbstractCegarLoop]: Abstraction has 2279 states and 2916 transitions. [2019-01-12 16:07:38,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 16:07:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2916 transitions. [2019-01-12 16:07:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 16:07:38,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:38,740 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,741 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash -888999647, now seen corresponding path program 1 times [2019-01-12 16:07:38,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:38,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:38,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:38,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:38,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 16:07:38,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 16:07:38,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 16:07:38,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 16:07:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 16:07:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 16:07:38,970 INFO L87 Difference]: Start difference. First operand 2279 states and 2916 transitions. Second operand 5 states. [2019-01-12 16:07:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:39,725 INFO L93 Difference]: Finished difference Result 3645 states and 4640 transitions. [2019-01-12 16:07:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 16:07:39,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-01-12 16:07:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:39,728 INFO L225 Difference]: With dead ends: 3645 [2019-01-12 16:07:39,728 INFO L226 Difference]: Without dead ends: 2091 [2019-01-12 16:07:39,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 16:07:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-12 16:07:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1491. [2019-01-12 16:07:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-01-12 16:07:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1871 transitions. [2019-01-12 16:07:40,160 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1871 transitions. Word has length 109 [2019-01-12 16:07:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:40,160 INFO L480 AbstractCegarLoop]: Abstraction has 1491 states and 1871 transitions. [2019-01-12 16:07:40,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 16:07:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1871 transitions. [2019-01-12 16:07:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 16:07:40,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:40,162 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 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:07:40,162 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash 420527879, now seen corresponding path program 1 times [2019-01-12 16:07:40,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:40,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:40,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:40,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:07:40,508 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 16:07:40,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:40,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:07:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 24 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:41,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:07:41,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-12 16:07:41,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 16:07:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 16:07:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-01-12 16:07:41,194 INFO L87 Difference]: Start difference. First operand 1491 states and 1871 transitions. Second operand 20 states. [2019-01-12 16:07:41,600 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-01-12 16:07:41,946 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-12 16:07:42,131 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-12 16:07:42,488 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-12 16:07:42,716 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-12 16:07:42,976 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-01-12 16:07:43,343 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-01-12 16:07:43,767 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-01-12 16:07:44,190 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-01-12 16:07:44,503 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-01-12 16:07:45,044 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-01-12 16:07:45,648 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-12 16:07:46,218 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-12 16:07:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:07:46,524 INFO L93 Difference]: Finished difference Result 2427 states and 3070 transitions. [2019-01-12 16:07:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 16:07:46,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 110 [2019-01-12 16:07:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:07:46,527 INFO L225 Difference]: With dead ends: 2427 [2019-01-12 16:07:46,527 INFO L226 Difference]: Without dead ends: 1697 [2019-01-12 16:07:46,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=286, Invalid=904, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 16:07:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-01-12 16:07:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1491. [2019-01-12 16:07:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-01-12 16:07:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1858 transitions. [2019-01-12 16:07:47,306 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1858 transitions. Word has length 110 [2019-01-12 16:07:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:07:47,307 INFO L480 AbstractCegarLoop]: Abstraction has 1491 states and 1858 transitions. [2019-01-12 16:07:47,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 16:07:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1858 transitions. [2019-01-12 16:07:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 16:07:47,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:07:47,308 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-12 16:07:47,308 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:07:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:07:47,309 INFO L82 PathProgramCache]: Analyzing trace with hash 167337625, now seen corresponding path program 1 times [2019-01-12 16:07:47,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:07:47,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:07:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:47,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:07:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:47,778 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 16:07:48,732 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-01-12 16:07:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:49,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:07:49,257 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 16:07:49,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:07:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:07:49,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:07:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:07:50,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:07:50,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14] total 43 [2019-01-12 16:07:50,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 16:07:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 16:07:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 16:07:50,655 INFO L87 Difference]: Start difference. First operand 1491 states and 1858 transitions. Second operand 44 states. [2019-01-12 16:07:51,473 WARN L181 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 129 [2019-01-12 16:07:51,886 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-12 16:07:52,237 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-12 16:07:52,647 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-01-12 16:07:53,089 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-01-12 16:07:53,484 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 74 [2019-01-12 16:07:54,216 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-01-12 16:07:54,920 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 115 [2019-01-12 16:07:55,368 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-01-12 16:07:55,858 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-01-12 16:07:56,490 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-01-12 16:07:57,364 WARN L181 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 114 [2019-01-12 16:07:58,087 WARN L181 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2019-01-12 16:07:58,484 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 94 [2019-01-12 16:07:58,935 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 100 [2019-01-12 16:07:59,474 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 99 [2019-01-12 16:07:59,929 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 100 [2019-01-12 16:08:00,354 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 97 [2019-01-12 16:08:01,100 WARN L181 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 115 [2019-01-12 16:08:01,878 WARN L181 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-01-12 16:08:02,557 WARN L181 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 111 [2019-01-12 16:08:03,191 WARN L181 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 126 [2019-01-12 16:08:03,921 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 105 [2019-01-12 16:08:04,573 WARN L181 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 121 [2019-01-12 16:08:05,404 WARN L181 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2019-01-12 16:08:06,081 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 125 [2019-01-12 16:08:06,964 WARN L181 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 131 [2019-01-12 16:08:08,085 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 98 [2019-01-12 16:08:08,738 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 119 [2019-01-12 16:08:09,315 WARN L181 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-01-12 16:08:09,877 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 113 [2019-01-12 16:08:10,575 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 118 [2019-01-12 16:08:11,180 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 114 [2019-01-12 16:08:11,825 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 114 [2019-01-12 16:08:12,446 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2019-01-12 16:08:13,028 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-01-12 16:08:13,613 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 118 [2019-01-12 16:08:14,316 WARN L181 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 120 [2019-01-12 16:08:15,140 WARN L181 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-01-12 16:08:15,639 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 121 [2019-01-12 16:08:16,436 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2019-01-12 16:08:16,864 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 97 [2019-01-12 16:08:17,389 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 117 [2019-01-12 16:08:17,961 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 117 [2019-01-12 16:08:18,428 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2019-01-12 16:08:18,976 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 98 [2019-01-12 16:08:19,443 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2019-01-12 16:08:20,113 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 133 [2019-01-12 16:08:20,716 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2019-01-12 16:08:21,145 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 110 [2019-01-12 16:08:21,737 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 125 [2019-01-12 16:08:21,962 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-12 16:08:22,203 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-01-12 16:08:22,594 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2019-01-12 16:08:23,123 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 115 [2019-01-12 16:08:23,619 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 110 [2019-01-12 16:08:23,948 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-01-12 16:08:24,308 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2019-01-12 16:08:24,840 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 119 [2019-01-12 16:08:25,299 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 113 [2019-01-12 16:08:25,975 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 142 [2019-01-12 16:08:26,745 WARN L181 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-01-12 16:08:27,606 WARN L181 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 146 [2019-01-12 16:08:27,947 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-01-12 16:08:28,297 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 103 [2019-01-12 16:08:29,489 WARN L181 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 140 [2019-01-12 16:08:29,909 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2019-01-12 16:08:30,570 WARN L181 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 129 [2019-01-12 16:08:30,796 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-12 16:08:31,263 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-01-12 16:08:31,601 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2019-01-12 16:08:32,108 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 123 [2019-01-12 16:08:32,940 WARN L181 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 121 [2019-01-12 16:08:33,604 WARN L181 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2019-01-12 16:08:34,866 WARN L181 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 133 [2019-01-12 16:08:35,377 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-01-12 16:08:35,959 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-01-12 16:08:36,915 WARN L181 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 126 [2019-01-12 16:08:37,433 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 92 [2019-01-12 16:08:37,689 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-01-12 16:08:38,346 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 122 [2019-01-12 16:08:38,854 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 98 [2019-01-12 16:08:39,498 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 127 [2019-01-12 16:08:40,208 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [2019-01-12 16:08:40,827 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 125 [2019-01-12 16:08:41,396 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 98 [2019-01-12 16:08:41,636 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-12 16:08:41,851 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-12 16:08:42,486 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 138 [2019-01-12 16:08:43,099 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 121 [2019-01-12 16:08:43,717 WARN L181 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2019-01-12 16:08:44,292 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2019-01-12 16:08:44,504 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-01-12 16:08:45,170 WARN L181 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 140 [2019-01-12 16:08:45,689 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 123 [2019-01-12 16:08:46,417 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 135 [2019-01-12 16:08:46,816 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-01-12 16:08:47,400 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 114 [2019-01-12 16:08:48,166 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2019-01-12 16:08:49,003 WARN L181 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2019-01-12 16:08:49,224 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-01-12 16:08:50,153 WARN L181 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2019-01-12 16:08:50,814 WARN L181 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 123 [2019-01-12 16:08:51,689 WARN L181 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 146 [2019-01-12 16:08:52,990 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 171 DAG size of output: 134 [2019-01-12 16:08:53,208 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-12 16:08:54,161 WARN L181 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-01-12 16:08:54,473 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-01-12 16:08:55,777 WARN L181 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 146 [2019-01-12 16:08:57,264 WARN L181 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 102 [2019-01-12 16:08:57,888 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 100 [2019-01-12 16:08:59,184 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 190 DAG size of output: 152 [2019-01-12 16:08:59,903 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 109 [2019-01-12 16:09:00,651 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-01-12 16:09:01,485 WARN L181 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 139 [2019-01-12 16:09:04,624 WARN L181 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 154 DAG size of output: 122 [2019-01-12 16:09:05,442 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 116 [2019-01-12 16:09:06,462 WARN L181 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 145 [2019-01-12 16:09:07,469 WARN L181 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 140 [2019-01-12 16:09:08,250 WARN L181 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 133 [2019-01-12 16:09:09,535 WARN L181 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 141 [2019-01-12 16:09:10,375 WARN L181 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 137 [2019-01-12 16:09:11,434 WARN L181 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 134 [2019-01-12 16:09:12,448 WARN L181 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 143 [2019-01-12 16:09:13,199 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-01-12 16:09:14,223 WARN L181 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 143 [2019-01-12 16:09:15,233 WARN L181 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 144 [2019-01-12 16:09:16,325 WARN L181 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 139 [2019-01-12 16:09:17,030 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-01-12 16:09:17,879 WARN L181 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 139 [2019-01-12 16:09:18,972 WARN L181 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 150 [2019-01-12 16:09:19,719 WARN L181 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 136 [2019-01-12 16:09:20,678 WARN L181 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 138 [2019-01-12 16:09:21,304 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 113 [2019-01-12 16:09:21,699 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 92 [2019-01-12 16:09:22,749 WARN L181 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 146 [2019-01-12 16:09:23,746 WARN L181 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 145 [2019-01-12 16:09:24,528 WARN L181 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 131 [2019-01-12 16:09:25,937 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 169 DAG size of output: 138 [2019-01-12 16:09:27,062 WARN L181 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 145 [2019-01-12 16:09:27,540 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2019-01-12 16:09:28,554 WARN L181 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 149 [2019-01-12 16:09:29,676 WARN L181 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 140 [2019-01-12 16:09:30,737 WARN L181 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 144 [2019-01-12 16:09:31,460 WARN L181 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 121 [2019-01-12 16:09:32,172 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2019-01-12 16:09:32,696 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 111 [2019-01-12 16:09:33,650 WARN L181 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 144 [2019-01-12 16:09:34,809 WARN L181 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 139 [2019-01-12 16:09:35,933 WARN L181 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 145 [2019-01-12 16:09:36,900 WARN L181 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 130 [2019-01-12 16:09:37,997 WARN L181 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 135 [2019-01-12 16:09:39,591 WARN L181 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 139 [2019-01-12 16:09:40,322 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2019-01-12 16:09:40,649 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-01-12 16:09:41,636 WARN L181 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 144 [2019-01-12 16:09:42,413 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2019-01-12 16:09:43,990 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 194 DAG size of output: 161 [2019-01-12 16:09:45,258 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 162 DAG size of output: 147 [2019-01-12 16:09:46,153 WARN L181 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 127 [2019-01-12 16:09:46,320 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-01-12 16:09:46,801 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-01-12 16:09:49,854 WARN L181 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-01-12 16:09:51,068 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 189 DAG size of output: 156 [2019-01-12 16:09:52,186 WARN L181 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 152 [2019-01-12 16:09:53,133 WARN L181 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2019-01-12 16:09:53,517 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 92 [2019-01-12 16:09:53,969 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2019-01-12 16:09:54,390 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2019-01-12 16:09:54,958 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 110 [2019-01-12 16:09:55,275 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-01-12 16:09:55,952 WARN L181 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-01-12 16:09:57,111 WARN L181 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 114 [2019-01-12 16:09:57,922 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2019-01-12 16:09:58,290 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-01-12 16:10:02,413 WARN L181 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 164 DAG size of output: 138 [2019-01-12 16:10:03,011 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-01-12 16:10:03,435 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2019-01-12 16:10:04,057 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2019-01-12 16:10:04,319 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-12 16:10:04,780 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2019-01-12 16:10:07,916 WARN L181 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 143 DAG size of output: 104 [2019-01-12 16:10:09,071 WARN L181 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 151 [2019-01-12 16:10:10,629 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 180 DAG size of output: 153 [2019-01-12 16:10:11,241 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-01-12 16:10:11,702 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 108 [2019-01-12 16:10:12,132 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 104 [2019-01-12 16:10:13,621 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 169 DAG size of output: 143 [2019-01-12 16:10:18,773 WARN L181 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 148 DAG size of output: 113 [2019-01-12 16:10:22,075 WARN L181 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 155 DAG size of output: 119 [2019-01-12 16:10:22,646 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 113 [2019-01-12 16:10:23,149 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-01-12 16:10:23,787 WARN L181 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 137 [2019-01-12 16:10:26,765 WARN L181 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2019-01-12 16:10:27,605 WARN L181 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 135 [2019-01-12 16:10:27,923 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-01-12 16:10:28,203 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-01-12 16:10:28,745 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2019-01-12 16:10:29,548 WARN L181 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 140 [2019-01-12 16:10:30,155 WARN L181 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 123 [2019-01-12 16:10:30,845 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 126 [2019-01-12 16:10:31,738 WARN L181 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-01-12 16:10:32,464 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 131 [2019-01-12 16:10:33,169 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 133 [2019-01-12 16:10:34,708 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 132 [2019-01-12 16:10:35,472 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 133 [2019-01-12 16:10:37,130 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-01-12 16:10:37,906 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-12 16:10:38,389 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-01-12 16:10:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:10:38,735 INFO L93 Difference]: Finished difference Result 8541 states and 10690 transitions. [2019-01-12 16:10:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2019-01-12 16:10:38,736 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 110 [2019-01-12 16:10:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:10:38,741 INFO L225 Difference]: With dead ends: 8541 [2019-01-12 16:10:38,741 INFO L226 Difference]: Without dead ends: 7253 [2019-01-12 16:10:38,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25407 ImplicationChecksByTransitivity, 154.6s TimeCoverageRelationStatistics Valid=9008, Invalid=60952, Unknown=0, NotChecked=0, Total=69960 [2019-01-12 16:10:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2019-01-12 16:10:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 3057. [2019-01-12 16:10:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3057 states. [2019-01-12 16:10:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 3788 transitions. [2019-01-12 16:10:40,176 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 3788 transitions. Word has length 110 [2019-01-12 16:10:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:10:40,177 INFO L480 AbstractCegarLoop]: Abstraction has 3057 states and 3788 transitions. [2019-01-12 16:10:40,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 16:10:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 3788 transitions. [2019-01-12 16:10:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 16:10:40,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:10:40,179 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 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:10:40,179 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:10:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:10:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1614355506, now seen corresponding path program 1 times [2019-01-12 16:10:40,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:10:40,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:10:40,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:10:40,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:10:40,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:10:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:10:40,632 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-01-12 16:10:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 34 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:10:41,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:10:41,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:41,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:10:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:10:41,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:10:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 25 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:10:43,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:10:43,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-01-12 16:10:43,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-12 16:10:43,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-12 16:10:43,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 16:10:43,136 INFO L87 Difference]: Start difference. First operand 3057 states and 3788 transitions. Second operand 37 states. [2019-01-12 16:10:45,057 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-01-12 16:10:45,322 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 16:10:45,621 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 16:10:46,003 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-01-12 16:10:46,385 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-01-12 16:10:46,827 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-01-12 16:10:47,282 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2019-01-12 16:10:47,674 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-01-12 16:10:48,024 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-12 16:10:48,402 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-01-12 16:10:48,983 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-01-12 16:10:49,241 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-12 16:10:49,762 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-01-12 16:10:50,146 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-01-12 16:10:51,102 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-01-12 16:10:51,511 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-01-12 16:10:52,042 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-01-12 16:10:52,383 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-01-12 16:10:52,715 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-01-12 16:10:52,965 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 16:10:53,168 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-01-12 16:10:53,693 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-01-12 16:10:54,002 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-01-12 16:10:54,184 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-12 16:10:54,615 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-12 16:10:54,816 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-01-12 16:10:55,084 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-01-12 16:10:55,458 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-01-12 16:10:55,722 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-12 16:10:56,064 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-01-12 16:10:56,324 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-12 16:10:56,727 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-01-12 16:10:56,982 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-12 16:10:57,316 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-01-12 16:10:57,845 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-01-12 16:10:58,106 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-12 16:10:58,698 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-01-12 16:10:59,139 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 16:11:00,803 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-01-12 16:11:01,186 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-12 16:11:02,329 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-12 16:11:02,749 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-12 16:11:03,603 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-12 16:11:04,101 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 16:11:06,542 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-12 16:11:06,972 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-01-12 16:11:07,207 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:11:07,375 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-12 16:11:07,589 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 16:11:07,831 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-12 16:11:08,200 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 16:11:08,693 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 16:11:08,958 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-12 16:11:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:11:13,328 INFO L93 Difference]: Finished difference Result 8917 states and 11198 transitions. [2019-01-12 16:11:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-01-12 16:11:13,328 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 111 [2019-01-12 16:11:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:11:13,336 INFO L225 Difference]: With dead ends: 8917 [2019-01-12 16:11:13,336 INFO L226 Difference]: Without dead ends: 7199 [2019-01-12 16:11:13,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6735 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=1570, Invalid=19600, Unknown=0, NotChecked=0, Total=21170 [2019-01-12 16:11:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2019-01-12 16:11:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 2197. [2019-01-12 16:11:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2197 states. [2019-01-12 16:11:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 2730 transitions. [2019-01-12 16:11:14,633 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 2730 transitions. Word has length 111 [2019-01-12 16:11:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:11:14,633 INFO L480 AbstractCegarLoop]: Abstraction has 2197 states and 2730 transitions. [2019-01-12 16:11:14,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-12 16:11:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 2730 transitions. [2019-01-12 16:11:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 16:11:14,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:11:14,635 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 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:11:14,635 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:11:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:11:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash 33528842, now seen corresponding path program 1 times [2019-01-12 16:11:14,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:11:14,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:11:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:11:14,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:11:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:11:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:11:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 31 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:11:14,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:11:14,943 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:11:14,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:11:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:11:15,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:11:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 16:11:15,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:11:15,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2019-01-12 16:11:15,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 16:11:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 16:11:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-12 16:11:15,535 INFO L87 Difference]: Start difference. First operand 2197 states and 2730 transitions. Second operand 17 states. [2019-01-12 16:11:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:11:21,127 INFO L93 Difference]: Finished difference Result 4709 states and 5856 transitions. [2019-01-12 16:11:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 16:11:21,128 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 111 [2019-01-12 16:11:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:11:21,131 INFO L225 Difference]: With dead ends: 4709 [2019-01-12 16:11:21,131 INFO L226 Difference]: Without dead ends: 2751 [2019-01-12 16:11:21,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=469, Invalid=2081, Unknown=0, NotChecked=0, Total=2550 [2019-01-12 16:11:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-01-12 16:11:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 1315. [2019-01-12 16:11:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2019-01-12 16:11:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1586 transitions. [2019-01-12 16:11:22,067 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1586 transitions. Word has length 111 [2019-01-12 16:11:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:11:22,067 INFO L480 AbstractCegarLoop]: Abstraction has 1315 states and 1586 transitions. [2019-01-12 16:11:22,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 16:11:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1586 transitions. [2019-01-12 16:11:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 16:11:22,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:11:22,068 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1] [2019-01-12 16:11:22,068 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:11:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:11:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1894314974, now seen corresponding path program 1 times [2019-01-12 16:11:22,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:11:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:11:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:11:22,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:11:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:11:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:11:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:11:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:11:23,332 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:11:23,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:11:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:11:23,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:11:24,043 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-12 16:11:24,390 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 16:11:24,604 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-01-12 16:11:25,131 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2019-01-12 16:11:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:11:27,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:11:27,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2019-01-12 16:11:27,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-12 16:11:27,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-12 16:11:27,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2128, Unknown=1, NotChecked=0, Total=2352 [2019-01-12 16:11:27,371 INFO L87 Difference]: Start difference. First operand 1315 states and 1586 transitions. Second operand 49 states. [2019-01-12 16:11:28,677 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2019-01-12 16:11:29,707 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-01-12 16:11:29,983 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-01-12 16:11:30,275 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-01-12 16:11:30,512 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-01-12 16:11:30,858 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-01-12 16:11:31,367 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-01-12 16:11:31,830 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-12 16:11:32,059 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-01-12 16:11:32,368 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-12 16:11:32,671 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-01-12 16:11:32,989 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-01-12 16:11:33,291 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-01-12 16:11:33,565 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-12 16:11:33,838 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-01-12 16:11:34,241 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-01-12 16:11:34,868 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-01-12 16:11:35,138 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-01-12 16:11:35,468 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-01-12 16:11:35,787 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-01-12 16:11:36,015 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-01-12 16:11:36,194 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-01-12 16:11:36,406 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-01-12 16:11:36,694 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-01-12 16:11:36,910 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-12 16:11:37,444 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-01-12 16:11:37,831 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-01-12 16:11:38,247 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-01-12 16:11:38,811 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-01-12 16:11:39,517 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2019-01-12 16:11:40,031 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-01-12 16:11:40,788 WARN L181 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 57 [2019-01-12 16:11:41,437 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-01-12 16:11:41,735 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-01-12 16:11:42,319 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-01-12 16:11:42,612 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-01-12 16:11:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:11:46,386 INFO L93 Difference]: Finished difference Result 4547 states and 5478 transitions. [2019-01-12 16:11:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-12 16:11:46,387 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 112 [2019-01-12 16:11:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:11:46,391 INFO L225 Difference]: With dead ends: 4547 [2019-01-12 16:11:46,391 INFO L226 Difference]: Without dead ends: 3485 [2019-01-12 16:11:46,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3009 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1296, Invalid=9209, Unknown=1, NotChecked=0, Total=10506 [2019-01-12 16:11:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2019-01-12 16:11:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 1971. [2019-01-12 16:11:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-01-12 16:11:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2345 transitions. [2019-01-12 16:11:47,841 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2345 transitions. Word has length 112 [2019-01-12 16:11:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:11:47,841 INFO L480 AbstractCegarLoop]: Abstraction has 1971 states and 2345 transitions. [2019-01-12 16:11:47,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-12 16:11:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2345 transitions. [2019-01-12 16:11:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 16:11:47,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:11:47,843 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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 16:11:47,843 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:11:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:11:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash -322430840, now seen corresponding path program 1 times [2019-01-12 16:11:47,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:11:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:11:47,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:11:47,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:11:47,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:11:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:11:48,218 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2019-01-12 16:11:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:11:49,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:11:49,209 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:11:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:11:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:11:49,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:11:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:11:50,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:11:50,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2019-01-12 16:11:50,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 16:11:50,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 16:11:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 16:11:50,384 INFO L87 Difference]: Start difference. First operand 1971 states and 2345 transitions. Second operand 36 states. [2019-01-12 16:11:51,528 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-01-12 16:11:51,728 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-12 16:11:51,918 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-12 16:11:52,165 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-01-12 16:11:52,636 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-01-12 16:11:53,050 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-01-12 16:11:53,524 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-12 16:11:53,846 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-01-12 16:11:54,010 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-01-12 16:11:54,376 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-01-12 16:11:54,613 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-01-12 16:11:54,886 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-12 16:11:55,136 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-01-12 16:11:55,408 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-01-12 16:11:55,600 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-12 16:11:56,007 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-01-12 16:11:56,349 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-01-12 16:11:56,554 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-12 16:11:56,836 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-01-12 16:11:57,237 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-12 16:11:57,875 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-01-12 16:11:58,136 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-01-12 16:11:58,678 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-01-12 16:11:58,885 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-01-12 16:11:59,746 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-01-12 16:12:00,045 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-01-12 16:12:00,513 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-01-12 16:12:00,964 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-01-12 16:12:01,513 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-01-12 16:12:02,044 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-01-12 16:12:03,413 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-01-12 16:12:03,616 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-01-12 16:12:04,094 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-01-12 16:12:04,334 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-12 16:12:04,874 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-01-12 16:12:05,174 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-01-12 16:12:05,824 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-01-12 16:12:06,142 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-01-12 16:12:06,465 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-01-12 16:12:06,740 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-01-12 16:12:07,138 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-12 16:12:07,404 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-01-12 16:12:08,340 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-12 16:12:08,610 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-12 16:12:09,319 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-12 16:12:12,161 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-12 16:12:12,850 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-01-12 16:12:13,167 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-01-12 16:12:13,717 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-12 16:12:14,028 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-12 16:12:14,411 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-01-12 16:12:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:12:16,342 INFO L93 Difference]: Finished difference Result 8626 states and 10467 transitions. [2019-01-12 16:12:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-12 16:12:16,342 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2019-01-12 16:12:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:12:16,348 INFO L225 Difference]: With dead ends: 8626 [2019-01-12 16:12:16,348 INFO L226 Difference]: Without dead ends: 7487 [2019-01-12 16:12:16,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2443 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1361, Invalid=8941, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 16:12:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7487 states. [2019-01-12 16:12:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7487 to 4419. [2019-01-12 16:12:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-12 16:12:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 5282 transitions. [2019-01-12 16:12:19,860 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 5282 transitions. Word has length 112 [2019-01-12 16:12:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:12:19,861 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 5282 transitions. [2019-01-12 16:12:19,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 16:12:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 5282 transitions. [2019-01-12 16:12:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 16:12:19,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:12:19,862 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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 16:12:19,863 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:12:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:12:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash 651450238, now seen corresponding path program 1 times [2019-01-12 16:12:19,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:12:19,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:12:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:12:19,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:12:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:12:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:12:20,455 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2019-01-12 16:12:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:12:21,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:12:21,094 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:12:21,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:12:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:12:21,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:12:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:12:22,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:12:22,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2019-01-12 16:12:22,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 16:12:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 16:12:22,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 16:12:22,351 INFO L87 Difference]: Start difference. First operand 4419 states and 5282 transitions. Second operand 36 states. [2019-01-12 16:12:23,104 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2019-01-12 16:12:26,928 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-01-12 16:12:28,361 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-01-12 16:12:31,782 WARN L181 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2019-01-12 16:12:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:12:38,641 INFO L93 Difference]: Finished difference Result 9899 states and 12027 transitions. [2019-01-12 16:12:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-12 16:12:38,642 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2019-01-12 16:12:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:12:38,649 INFO L225 Difference]: With dead ends: 9899 [2019-01-12 16:12:38,650 INFO L226 Difference]: Without dead ends: 8347 [2019-01-12 16:12:38,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1075, Invalid=9227, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 16:12:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8347 states. [2019-01-12 16:12:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8347 to 6239. [2019-01-12 16:12:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6239 states. [2019-01-12 16:12:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 7475 transitions. [2019-01-12 16:12:43,657 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 7475 transitions. Word has length 112 [2019-01-12 16:12:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:12:43,658 INFO L480 AbstractCegarLoop]: Abstraction has 6239 states and 7475 transitions. [2019-01-12 16:12:43,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 16:12:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 7475 transitions. [2019-01-12 16:12:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-12 16:12:43,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:12:43,659 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 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 16:12:43,660 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:12:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:12:43,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1507732342, now seen corresponding path program 1 times [2019-01-12 16:12:43,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:12:43,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:12:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:12:43,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:12:43,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:12:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:12:43,927 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-12 16:12:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:12:44,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:12:44,550 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:12:44,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:12:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:12:44,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:12:45,824 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-12 16:12:46,034 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-12 16:12:46,257 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-12 16:12:46,607 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-01-12 16:12:46,823 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-12 16:12:47,046 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-12 16:12:47,390 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-01-12 16:12:47,963 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-12 16:12:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:12:49,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:12:49,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 50 [2019-01-12 16:12:49,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 16:12:49,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 16:12:49,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 16:12:49,679 INFO L87 Difference]: Start difference. First operand 6239 states and 7475 transitions. Second operand 50 states. [2019-01-12 16:12:50,507 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-12 16:12:50,729 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-01-12 16:12:51,015 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-12 16:12:51,350 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-01-12 16:12:51,715 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-01-12 16:12:52,099 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-01-12 16:12:52,547 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-12 16:12:52,920 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-01-12 16:12:53,464 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2019-01-12 16:12:54,055 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-01-12 16:12:54,460 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 38 [2019-01-12 16:12:55,109 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2019-01-12 16:12:55,575 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-12 16:12:55,985 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-01-12 16:12:56,207 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-01-12 16:12:56,609 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-01-12 16:12:56,926 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-01-12 16:12:58,789 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-01-12 16:12:59,757 WARN L181 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-12 16:13:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:13:14,774 INFO L93 Difference]: Finished difference Result 14674 states and 17814 transitions. [2019-01-12 16:13:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-01-12 16:13:14,775 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 114 [2019-01-12 16:13:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:13:14,783 INFO L225 Difference]: With dead ends: 14674 [2019-01-12 16:13:14,783 INFO L226 Difference]: Without dead ends: 11147 [2019-01-12 16:13:14,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8359 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=1582, Invalid=21674, Unknown=0, NotChecked=0, Total=23256 [2019-01-12 16:13:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2019-01-12 16:13:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 8481. [2019-01-12 16:13:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8481 states. [2019-01-12 16:13:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 10181 transitions. [2019-01-12 16:13:21,645 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 10181 transitions. Word has length 114 [2019-01-12 16:13:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:13:21,645 INFO L480 AbstractCegarLoop]: Abstraction has 8481 states and 10181 transitions. [2019-01-12 16:13:21,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 16:13:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 10181 transitions. [2019-01-12 16:13:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 16:13:21,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:13:21,650 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 16:13:21,651 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:13:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:13:21,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1142772166, now seen corresponding path program 1 times [2019-01-12 16:13:21,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:13:21,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:13:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:13:21,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:13:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:13:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:13:21,984 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2019-01-12 16:13:22,249 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 6 [2019-01-12 16:13:22,775 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-12 16:13:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 27 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:13:23,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:13:23,942 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:13:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:13:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:13:24,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:13:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 37 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:13:25,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:13:25,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20] total 50 [2019-01-12 16:13:25,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 16:13:25,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 16:13:25,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2311, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 16:13:25,789 INFO L87 Difference]: Start difference. First operand 8481 states and 10181 transitions. Second operand 50 states. [2019-01-12 16:13:25,987 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-12 16:13:32,407 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-12 16:13:36,996 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-01-12 16:13:40,090 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-01-12 16:13:42,991 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2019-01-12 16:13:43,620 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-01-12 16:13:43,832 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-01-12 16:13:44,729 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-01-12 16:13:44,935 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-01-12 16:13:46,071 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-01-12 16:13:50,245 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-01-12 16:13:50,479 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-01-12 16:13:50,683 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 16:13:50,870 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-12 16:13:51,103 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-01-12 16:13:52,157 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-12 16:13:53,460 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-01-12 16:13:53,655 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-12 16:13:53,905 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-12 16:13:54,293 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-01-12 16:13:54,874 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-01-12 16:13:57,933 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-12 16:13:58,525 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-01-12 16:14:03,207 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-12 16:14:03,462 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 16:14:06,012 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-01-12 16:14:12,246 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-01-12 16:14:12,495 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 16:14:13,155 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-01-12 16:14:15,568 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 16:14:23,558 WARN L181 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-01-12 16:14:24,033 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-12 16:14:24,453 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-12 16:14:24,693 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-01-12 16:14:25,149 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 16:14:27,797 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-01-12 16:14:28,001 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-01-12 16:14:28,342 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 16:14:32,965 WARN L181 SmtUtils]: Spent 3.86 s on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-01-12 16:14:33,416 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-01-12 16:14:33,644 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-12 16:14:36,405 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-12 16:14:38,688 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-12 16:14:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:14:48,519 INFO L93 Difference]: Finished difference Result 17559 states and 21418 transitions. [2019-01-12 16:14:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-12 16:14:48,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 156 [2019-01-12 16:14:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:14:48,532 INFO L225 Difference]: With dead ends: 17559 [2019-01-12 16:14:48,533 INFO L226 Difference]: Without dead ends: 16829 [2019-01-12 16:14:48,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9275 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=3248, Invalid=28972, Unknown=0, NotChecked=0, Total=32220 [2019-01-12 16:14:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16829 states. [2019-01-12 16:14:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16829 to 10434. [2019-01-12 16:14:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-01-12 16:14:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 12614 transitions. [2019-01-12 16:14:57,132 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 12614 transitions. Word has length 156 [2019-01-12 16:14:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:14:57,132 INFO L480 AbstractCegarLoop]: Abstraction has 10434 states and 12614 transitions. [2019-01-12 16:14:57,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 16:14:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 12614 transitions. [2019-01-12 16:14:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 16:14:57,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:14:57,137 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 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] [2019-01-12 16:14:57,137 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:14:57,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:14:57,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1837535088, now seen corresponding path program 2 times [2019-01-12 16:14:57,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:14:57,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:14:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:14:57,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:14:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:14:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:14:57,429 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-12 16:14:57,727 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 16:14:57,986 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 16:14:58,304 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-01-12 16:14:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 78 proven. 160 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 16:14:59,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:14:59,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:59,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 16:14:59,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 16:14:59,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 16:14:59,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:15:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 149 proven. 68 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-12 16:15:00,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:15:00,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2019-01-12 16:15:00,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-12 16:15:00,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-12 16:15:00,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1568, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 16:15:00,230 INFO L87 Difference]: Start difference. First operand 10434 states and 12614 transitions. Second operand 42 states. [2019-01-12 16:15:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:15:15,648 INFO L93 Difference]: Finished difference Result 15961 states and 19437 transitions. [2019-01-12 16:15:15,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 16:15:15,649 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 157 [2019-01-12 16:15:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:15:15,660 INFO L225 Difference]: With dead ends: 15961 [2019-01-12 16:15:15,661 INFO L226 Difference]: Without dead ends: 14054 [2019-01-12 16:15:15,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=727, Invalid=4675, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 16:15:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2019-01-12 16:15:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 10101. [2019-01-12 16:15:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10101 states. [2019-01-12 16:15:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10101 states to 10101 states and 12240 transitions. [2019-01-12 16:15:24,030 INFO L78 Accepts]: Start accepts. Automaton has 10101 states and 12240 transitions. Word has length 157 [2019-01-12 16:15:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:15:24,030 INFO L480 AbstractCegarLoop]: Abstraction has 10101 states and 12240 transitions. [2019-01-12 16:15:24,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-12 16:15:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 10101 states and 12240 transitions. [2019-01-12 16:15:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 16:15:24,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:15:24,036 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:15:24,036 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:15:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:15:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1883345769, now seen corresponding path program 1 times [2019-01-12 16:15:24,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:15:24,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:15:24,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:15:24,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 16:15:24,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:15:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:15:24,352 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-12 16:15:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 43 proven. 203 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 16:15:24,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:15:24,957 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:15:24,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:15:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:15:25,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:15:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 54 proven. 192 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 16:15:26,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:15:26,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-01-12 16:15:26,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 16:15:26,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 16:15:26,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 16:15:26,160 INFO L87 Difference]: Start difference. First operand 10101 states and 12240 transitions. Second operand 36 states. [2019-01-12 16:15:28,754 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-01-12 16:15:39,016 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-12 16:15:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:15:48,783 INFO L93 Difference]: Finished difference Result 22564 states and 27749 transitions. [2019-01-12 16:15:48,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 16:15:48,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 157 [2019-01-12 16:15:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:15:48,803 INFO L225 Difference]: With dead ends: 22564 [2019-01-12 16:15:48,803 INFO L226 Difference]: Without dead ends: 16885 [2019-01-12 16:15:48,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=464, Invalid=3076, Unknown=0, NotChecked=0, Total=3540 [2019-01-12 16:15:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16885 states. [2019-01-12 16:16:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16885 to 13415. [2019-01-12 16:16:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13415 states. [2019-01-12 16:16:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13415 states to 13415 states and 16312 transitions. [2019-01-12 16:16:00,145 INFO L78 Accepts]: Start accepts. Automaton has 13415 states and 16312 transitions. Word has length 157 [2019-01-12 16:16:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:16:00,145 INFO L480 AbstractCegarLoop]: Abstraction has 13415 states and 16312 transitions. [2019-01-12 16:16:00,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 16:16:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 13415 states and 16312 transitions. [2019-01-12 16:16:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 16:16:00,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:16:00,151 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:16:00,151 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:16:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:16:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1710341201, now seen corresponding path program 1 times [2019-01-12 16:16:00,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:16:00,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:16:00,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:16:00,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:16:00,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:16:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:16:00,604 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-12 16:16:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 27 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 16:16:04,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 16:16:04,464 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:16:04,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:16:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 16:16:04,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 16:16:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 170 proven. 35 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-01-12 16:16:05,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 16:16:05,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 12] total 54 [2019-01-12 16:16:05,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-12 16:16:05,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-12 16:16:05,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2686, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 16:16:05,416 INFO L87 Difference]: Start difference. First operand 13415 states and 16312 transitions. Second operand 54 states. [2019-01-12 16:16:05,810 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2019-01-12 16:16:07,571 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-12 16:16:07,919 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-01-12 16:16:08,193 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-01-12 16:16:08,500 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-01-12 16:16:08,965 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-01-12 16:16:11,095 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-01-12 16:16:14,014 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-01-12 16:16:14,309 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-12 16:16:15,788 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-01-12 16:16:16,510 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-12 16:16:17,337 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-01-12 16:16:17,733 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-01-12 16:16:20,312 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-01-12 16:16:23,355 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2019-01-12 16:16:23,719 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-01-12 16:16:24,424 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-01-12 16:16:25,253 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-01-12 16:16:25,857 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-12 16:16:26,626 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-12 16:16:27,473 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-12 16:16:40,714 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 16:16:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 16:16:55,289 INFO L93 Difference]: Finished difference Result 35942 states and 44693 transitions. [2019-01-12 16:16:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-12 16:16:55,289 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 157 [2019-01-12 16:16:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 16:16:55,312 INFO L225 Difference]: With dead ends: 35942 [2019-01-12 16:16:55,312 INFO L226 Difference]: Without dead ends: 26567 [2019-01-12 16:16:55,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3033 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=1026, Invalid=13734, Unknown=2, NotChecked=0, Total=14762 [2019-01-12 16:16:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26567 states. [2019-01-12 16:17:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26567 to 15152. [2019-01-12 16:17:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15152 states. [2019-01-12 16:17:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15152 states to 15152 states and 18479 transitions. [2019-01-12 16:17:08,428 INFO L78 Accepts]: Start accepts. Automaton has 15152 states and 18479 transitions. Word has length 157 [2019-01-12 16:17:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 16:17:08,429 INFO L480 AbstractCegarLoop]: Abstraction has 15152 states and 18479 transitions. [2019-01-12 16:17:08,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-12 16:17:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 15152 states and 18479 transitions. [2019-01-12 16:17:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-12 16:17:08,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 16:17:08,434 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 16:17:08,434 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 16:17:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 16:17:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash 181442750, now seen corresponding path program 1 times [2019-01-12 16:17:08,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 16:17:08,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 16:17:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:17:08,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 16:17:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 16:17:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 16:17:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 16:17:08,556 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 16:17:08,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:17:08 BoogieIcfgContainer [2019-01-12 16:17:08,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 16:17:08,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 16:17:08,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 16:17:08,740 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 16:17:08,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:05:07" (3/4) ... [2019-01-12 16:17:08,748 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 16:17:08,944 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 16:17:08,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 16:17:08,945 INFO L168 Benchmark]: Toolchain (without parser) took 722173.14 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 947.3 MB in the beginning and 1.6 GB in the end (delta: -642.4 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-01-12 16:17:08,948 INFO L168 Benchmark]: CDTParser took 0.22 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:17:08,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.91 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 16:17:08,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 16:17:08,948 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 16:17:08,948 INFO L168 Benchmark]: RCFGBuilder took 738.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-01-12 16:17:08,948 INFO L168 Benchmark]: TraceAbstraction took 720739.62 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -531.8 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-01-12 16:17:08,953 INFO L168 Benchmark]: Witness Printer took 204.88 ms. Allocated memory is still 4.6 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 16:17:08,954 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.22 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 341.91 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 738.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 720739.62 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -531.8 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 204.88 ms. Allocated memory is still 4.6 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 330]: 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] unsigned 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] port_t p2 ; [L80] char p2_old ; [L81] char p2_new ; [L82] char id2 ; [L83] char st2 ; [L84] msg_t send2 ; [L85] _Bool mode2 ; [L86] port_t p3 ; [L87] char p3_old ; [L88] char p3_new ; [L89] char id3 ; [L90] char st3 ; [L91] msg_t send3 ; [L92] _Bool mode3 ; [L174] void (*nodes[3])(void) = { & node1, & node2, & node3}; VAL [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] [L278] int c1 ; [L279] int i2 ; [L282] c1 = 0 [L283] r1 = __VERIFIER_nondet_uchar() [L284] id1 = __VERIFIER_nondet_char() [L285] st1 = __VERIFIER_nondet_char() [L286] send1 = __VERIFIER_nondet_char() [L287] mode1 = __VERIFIER_nondet_bool() [L288] id2 = __VERIFIER_nondet_char() [L289] st2 = __VERIFIER_nondet_char() [L290] send2 = __VERIFIER_nondet_char() [L291] mode2 = __VERIFIER_nondet_bool() [L292] id3 = __VERIFIER_nondet_char() [L293] st3 = __VERIFIER_nondet_char() [L294] send3 = __VERIFIER_nondet_char() [L295] mode3 = __VERIFIER_nondet_bool() [L177] int tmp ; VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L180] COND TRUE (int )r1 == 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L181] COND TRUE (int )id1 >= 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L182] COND TRUE (int )st1 == 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L183] COND TRUE (int )send1 == (int )id1 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L184] COND TRUE (int )mode1 == 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L185] COND TRUE (int )id2 >= 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L186] COND TRUE (int )st2 == 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L187] COND TRUE (int )send2 == (int )id2 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L188] COND TRUE (int )mode2 == 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L189] COND TRUE (int )id3 >= 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L190] COND TRUE (int )st3 == 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L191] COND TRUE (int )send3 == (int )id3 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L192] COND TRUE (int )mode3 == 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L193] COND TRUE (int )id1 != (int )id2 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L194] COND TRUE (int )id1 != (int )id3 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L195] COND TRUE (int )id2 != (int )id3 [L196] tmp = 1 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L245] return (tmp); VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L296] i2 = init() [L298] p1_old = nomsg [L299] p1_new = nomsg [L300] p2_old = nomsg [L301] p2_new = nomsg [L302] p3_old = nomsg [L303] p3_new = nomsg [L304] i2 = 0 VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L305] COND TRUE 1 [L95] msg_t m1 ; [L98] m1 = nomsg VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L99] COND FALSE !(\read(mode1)) VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L118] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new VAL [id1=127, id2=126, id3=125, 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=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L118] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L119] mode1 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L126] msg_t m2 ; [L129] m2 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L130] COND FALSE !(\read(mode2)) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L143] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L143] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L144] mode2 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L151] msg_t m3 ; [L154] m3 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L155] COND FALSE !(\read(mode3)) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L168] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L168] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L169] mode3 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=125, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L250] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L273] return (tmp); VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L316] c1 = check() [L328] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L305] COND TRUE 1 [L95] msg_t m1 ; [L98] m1 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L99] COND TRUE \read(mode1) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L100] COND FALSE !(r1 == 255) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L103] r1 = r1 + 1 [L104] m1 = p3_old [L105] p3_old = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L107] COND FALSE !((int )m1 > (int )id1) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L110] COND FALSE !((int )m1 == (int )id1) [L113] send1 = m1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L116] mode1 = (_Bool)0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L126] msg_t m2 ; [L129] m2 = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L130] COND TRUE \read(mode2) [L131] m2 = p1_old [L132] p1_old = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L133] COND TRUE (int )m2 != (int )nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L134] COND TRUE (int )m2 > (int )id2 [L135] send2 = m2 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L141] mode2 = (_Bool)0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L151] msg_t m3 ; [L154] m3 = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L155] COND TRUE \read(mode3) [L156] m3 = p2_old [L157] p2_old = nomsg VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L158] COND TRUE (int )m3 != (int )nomsg VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L159] COND TRUE (int )m3 > (int )id3 [L160] send3 = m3 VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L166] mode3 = (_Bool)0 VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L250] int tmp ; VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L273] return (tmp); VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L316] c1 = check() [L328] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L305] COND TRUE 1 [L95] msg_t m1 ; [L98] m1 = nomsg VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L99] COND FALSE !(\read(mode1)) VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L118] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new VAL [id1=127, id2=126, id3=125, 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=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L118] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L119] mode1 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L126] msg_t m2 ; [L129] m2 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L130] COND FALSE !(\read(mode2)) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L143] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L143] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L144] mode2 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L151] msg_t m3 ; [L154] m3 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L155] COND FALSE !(\read(mode3)) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L168] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L168] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L169] mode3 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=126, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L250] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L273] return (tmp); VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L316] c1 = check() [L328] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L305] COND TRUE 1 [L95] msg_t m1 ; [L98] m1 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L99] COND TRUE \read(mode1) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L100] COND FALSE !(r1 == 255) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L103] r1 = r1 + 1 [L104] m1 = p3_old [L105] p3_old = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L107] COND FALSE !((int )m1 > (int )id1) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L110] COND FALSE !((int )m1 == (int )id1) [L113] send1 = m1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L116] mode1 = (_Bool)0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L126] msg_t m2 ; [L129] m2 = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L130] COND TRUE \read(mode2) [L131] m2 = p1_old [L132] p1_old = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L133] COND TRUE (int )m2 != (int )nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L134] COND FALSE !((int )m2 > (int )id2) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 == (int )id2) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L141] mode2 = (_Bool)0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L151] msg_t m3 ; [L154] m3 = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L155] COND TRUE \read(mode3) [L156] m3 = p2_old [L157] p2_old = nomsg VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L158] COND TRUE (int )m3 != (int )nomsg VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L159] COND TRUE (int )m3 > (int )id3 [L160] send3 = m3 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L166] mode3 = (_Bool)0 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L250] int tmp ; VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L273] return (tmp); VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L316] c1 = check() [L328] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L305] COND TRUE 1 [L95] msg_t m1 ; [L98] m1 = nomsg VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L99] COND FALSE !(\read(mode1)) VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L118] EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L118] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L119] mode1 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L126] msg_t m2 ; [L129] m2 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L130] COND FALSE !(\read(mode2)) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L143] EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new VAL [id1=127, id2=126, id3=125, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L143] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L144] mode2 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L151] msg_t m3 ; [L154] m3 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L155] COND FALSE !(\read(mode3)) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L168] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L168] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L169] mode3 = (_Bool)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L250] int tmp ; VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L273] return (tmp); VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L316] c1 = check() [L328] COND FALSE !(! arg) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L305] COND TRUE 1 [L95] msg_t m1 ; [L98] m1 = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L99] COND TRUE \read(mode1) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L100] COND FALSE !(r1 == 255) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L103] r1 = r1 + 1 [L104] m1 = p3_old [L105] p3_old = nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !((int )m1 > (int )id1) VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L110] COND TRUE (int )m1 == (int )id1 [L111] st1 = (char)1 VAL [id1=127, id2=126, id3=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L116] mode1 = (_Bool)0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L126] msg_t m2 ; [L129] m2 = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L130] COND TRUE \read(mode2) [L131] m2 = p1_old [L132] p1_old = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L133] COND TRUE (int )m2 != (int )nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L134] COND FALSE !((int )m2 > (int )id2) VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L137] COND TRUE (int )m2 == (int )id2 [L138] st2 = (char)1 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L141] mode2 = (_Bool)0 VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L151] msg_t m3 ; [L154] m3 = nomsg VAL [id1=127, id2=126, id3=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L155] COND TRUE \read(mode3) [L156] m3 = p2_old [L157] p2_old = nomsg VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L158] COND TRUE (int )m3 != (int )nomsg VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L159] COND TRUE (int )m3 > (int )id3 [L160] send3 = m3 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L166] mode3 = (_Bool)0 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L250] int tmp ; VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L253] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L271] tmp = 0 VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L273] return (tmp); VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L316] c1 = check() [L328] COND TRUE ! arg VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L330] __VERIFIER_error() VAL [id1=127, id2=126, id3=125, 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=126, send2=127, send3=127, st1=1, st2=1, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 1 error locations. UNSAFE Result, 720.6s OverallTime, 37 OverallIterations, 6 TraceHistogramMax, 588.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5456 SDtfs, 34739 SDslu, 81637 SDs, 0 SdLazy, 38162 SolverSat, 3679 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 103.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3802 GetRequests, 1795 SyntacticMatches, 18 SemanticMatches, 1989 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109571 ImplicationChecksByTransitivity, 390.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20809occurred in iteration=15, 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: 81.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 123821 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 46.4s InterpolantComputationTime, 5111 NumberOfCodeBlocks, 5111 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 4898 ConstructedInterpolants, 873 QuantifiedInterpolants, 11228706 SizeOfPredicates, 129 NumberOfNonLiveVariables, 7793 ConjunctsInSsa, 506 ConjunctsInUnsatCore, 55 InterpolantComputations, 19 PerfectInterpolantSequences, 1571/4150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...