java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:00:45,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:00:45,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:00:45,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:00:45,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:00:45,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:00:45,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:00:45,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:00:45,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:00:45,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:00:45,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:00:45,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:00:45,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:00:45,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:00:45,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:00:45,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:00:45,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:00:45,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:00:45,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:00:45,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:00:45,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:00:45,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:00:45,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:00:45,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:00:45,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:00:45,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:00:45,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:00:45,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:00:45,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:00:45,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:00:45,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:00:45,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:00:45,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:00:45,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:00:45,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:00:45,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:00:45,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:00:45,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:00:45,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:00:45,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:00:45,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:00:45,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 03:00:45,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:00:45,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:00:45,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:00:45,836 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:00:45,837 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:00:45,837 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:00:45,837 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:00:45,837 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:00:45,837 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:00:45,838 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:00:45,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:00:45,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:00:45,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:00:45,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:00:45,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:00:45,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:00:45,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:00:45,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:00:45,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:00:45,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:00:45,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:00:45,842 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:00:45,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:00:45,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:00:45,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:00:45,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:00:45,844 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:00:45,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:00:45,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:00:45,844 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:00:45,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:00:45,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:00:45,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:00:45,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:00:45,898 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:00:45,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-03 03:00:45,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/750ec3317/b25563b32222463bad1dc67444c13ca2/FLAGd5000bb89 [2019-10-03 03:00:46,495 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:00:46,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-03 03:00:46,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/750ec3317/b25563b32222463bad1dc67444c13ca2/FLAGd5000bb89 [2019-10-03 03:00:46,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/750ec3317/b25563b32222463bad1dc67444c13ca2 [2019-10-03 03:00:46,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:00:46,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:00:46,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:00:46,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:00:46,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:00:46,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:00:46" (1/1) ... [2019-10-03 03:00:46,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75485a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:46, skipping insertion in model container [2019-10-03 03:00:46,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:00:46" (1/1) ... [2019-10-03 03:00:46,844 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:00:46,892 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:00:47,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:00:47,300 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:00:47,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:00:47,416 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:00:47,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47 WrapperNode [2019-10-03 03:00:47,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:00:47,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:00:47,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:00:47,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:00:47,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:00:47,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:00:47,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:00:47,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:00:47,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (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-10-03 03:00:47,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:00:47,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:00:47,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:00:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:00:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:00:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:00:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:00:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:00:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:00:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:00:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:00:47,538 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:00:47,538 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:00:47,538 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:00:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:00:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:00:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:00:47,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:00:48,327 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:00:48,328 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:00:48,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:00:48 BoogieIcfgContainer [2019-10-03 03:00:48,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:00:48,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:00:48,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:00:48,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:00:48,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:00:46" (1/3) ... [2019-10-03 03:00:48,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e2e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:00:48, skipping insertion in model container [2019-10-03 03:00:48,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47" (2/3) ... [2019-10-03 03:00:48,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e2e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:00:48, skipping insertion in model container [2019-10-03 03:00:48,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:00:48" (3/3) ... [2019-10-03 03:00:48,338 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-03 03:00:48,348 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:00:48,356 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 03:00:48,374 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 03:00:48,401 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:00:48,402 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:00:48,402 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:00:48,402 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:00:48,403 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:00:48,403 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:00:48,403 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:00:48,403 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:00:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-10-03 03:00:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 03:00:48,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:48,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:48,438 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:48,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:48,443 INFO L82 PathProgramCache]: Analyzing trace with hash 273290580, now seen corresponding path program 1 times [2019-10-03 03:00:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:48,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:48,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:48,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:48,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:48,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:00:48,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:48,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:48,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:00:48,963 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 6 states. [2019-10-03 03:00:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:49,403 INFO L93 Difference]: Finished difference Result 668 states and 1034 transitions. [2019-10-03 03:00:49,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:00:49,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-03 03:00:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:49,432 INFO L225 Difference]: With dead ends: 668 [2019-10-03 03:00:49,433 INFO L226 Difference]: Without dead ends: 632 [2019-10-03 03:00:49,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:00:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-03 03:00:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 425. [2019-10-03 03:00:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-03 03:00:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2019-10-03 03:00:49,520 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 53 [2019-10-03 03:00:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:49,520 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2019-10-03 03:00:49,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2019-10-03 03:00:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:49,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:49,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:49,524 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1842914518, now seen corresponding path program 1 times [2019-10-03 03:00:49,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:49,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:49,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:49,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:49,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:49,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:49,683 INFO L87 Difference]: Start difference. First operand 425 states and 641 transitions. Second operand 3 states. [2019-10-03 03:00:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:49,722 INFO L93 Difference]: Finished difference Result 751 states and 1126 transitions. [2019-10-03 03:00:49,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:49,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-03 03:00:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:49,728 INFO L225 Difference]: With dead ends: 751 [2019-10-03 03:00:49,728 INFO L226 Difference]: Without dead ends: 751 [2019-10-03 03:00:49,729 INFO L640 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-10-03 03:00:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-10-03 03:00:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2019-10-03 03:00:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-03 03:00:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1125 transitions. [2019-10-03 03:00:49,758 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1125 transitions. Word has length 56 [2019-10-03 03:00:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:49,759 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1125 transitions. [2019-10-03 03:00:49,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1125 transitions. [2019-10-03 03:00:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:49,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:49,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:49,763 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash -315457832, now seen corresponding path program 1 times [2019-10-03 03:00:49,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:49,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:49,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:49,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:49,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:49,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:49,885 INFO L87 Difference]: Start difference. First operand 749 states and 1125 transitions. Second operand 3 states. [2019-10-03 03:00:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:49,940 INFO L93 Difference]: Finished difference Result 1339 states and 1975 transitions. [2019-10-03 03:00:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:49,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-03 03:00:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:49,953 INFO L225 Difference]: With dead ends: 1339 [2019-10-03 03:00:49,961 INFO L226 Difference]: Without dead ends: 1339 [2019-10-03 03:00:49,962 INFO L640 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-10-03 03:00:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-10-03 03:00:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-10-03 03:00:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-03 03:00:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1974 transitions. [2019-10-03 03:00:50,006 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1974 transitions. Word has length 56 [2019-10-03 03:00:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:50,009 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1974 transitions. [2019-10-03 03:00:50,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1974 transitions. [2019-10-03 03:00:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:00:50,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:50,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:50,013 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash -622080838, now seen corresponding path program 1 times [2019-10-03 03:00:50,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:50,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:50,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:50,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:50,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:50,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:00:50,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:50,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:00:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:00:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:00:50,291 INFO L87 Difference]: Start difference. First operand 1337 states and 1974 transitions. Second operand 10 states. [2019-10-03 03:00:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:51,872 INFO L93 Difference]: Finished difference Result 7375 states and 10947 transitions. [2019-10-03 03:00:51,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:00:51,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-10-03 03:00:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:51,913 INFO L225 Difference]: With dead ends: 7375 [2019-10-03 03:00:51,913 INFO L226 Difference]: Without dead ends: 7375 [2019-10-03 03:00:51,914 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:00:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2019-10-03 03:00:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 1362. [2019-10-03 03:00:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-10-03 03:00:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2006 transitions. [2019-10-03 03:00:52,024 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2006 transitions. Word has length 57 [2019-10-03 03:00:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:52,025 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2006 transitions. [2019-10-03 03:00:52,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:00:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2006 transitions. [2019-10-03 03:00:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:00:52,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:52,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:52,028 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:52,028 INFO L82 PathProgramCache]: Analyzing trace with hash -993204644, now seen corresponding path program 1 times [2019-10-03 03:00:52,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:52,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:52,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:52,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:00:52,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:52,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:00:52,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:00:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:00:52,161 INFO L87 Difference]: Start difference. First operand 1362 states and 2006 transitions. Second operand 9 states. [2019-10-03 03:00:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:53,906 INFO L93 Difference]: Finished difference Result 7508 states and 11110 transitions. [2019-10-03 03:00:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:00:53,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-03 03:00:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:53,955 INFO L225 Difference]: With dead ends: 7508 [2019-10-03 03:00:53,955 INFO L226 Difference]: Without dead ends: 7508 [2019-10-03 03:00:53,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:00:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2019-10-03 03:00:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 1401. [2019-10-03 03:00:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-03 03:00:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2057 transitions. [2019-10-03 03:00:54,117 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2057 transitions. Word has length 58 [2019-10-03 03:00:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:54,118 INFO L475 AbstractCegarLoop]: Abstraction has 1401 states and 2057 transitions. [2019-10-03 03:00:54,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:00:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2057 transitions. [2019-10-03 03:00:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:00:54,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:54,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:54,120 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:54,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1499714113, now seen corresponding path program 1 times [2019-10-03 03:00:54,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:54,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:54,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:54,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:00:54,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:54,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:00:54,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:00:54,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:00:54,278 INFO L87 Difference]: Start difference. First operand 1401 states and 2057 transitions. Second operand 7 states. [2019-10-03 03:00:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:54,867 INFO L93 Difference]: Finished difference Result 5365 states and 8059 transitions. [2019-10-03 03:00:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:00:54,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-03 03:00:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:54,892 INFO L225 Difference]: With dead ends: 5365 [2019-10-03 03:00:54,892 INFO L226 Difference]: Without dead ends: 5365 [2019-10-03 03:00:54,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:00:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-10-03 03:00:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 1382. [2019-10-03 03:00:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-03 03:00:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2033 transitions. [2019-10-03 03:00:54,955 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2033 transitions. Word has length 58 [2019-10-03 03:00:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:54,955 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 2033 transitions. [2019-10-03 03:00:54,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:00:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2033 transitions. [2019-10-03 03:00:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:00:54,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:54,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:54,958 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1924616750, now seen corresponding path program 1 times [2019-10-03 03:00:54,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:55,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:55,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:00:55,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:55,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:00:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:00:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:00:55,066 INFO L87 Difference]: Start difference. First operand 1382 states and 2033 transitions. Second operand 7 states. [2019-10-03 03:00:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:55,507 INFO L93 Difference]: Finished difference Result 4526 states and 6662 transitions. [2019-10-03 03:00:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:00:55,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-03 03:00:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:55,541 INFO L225 Difference]: With dead ends: 4526 [2019-10-03 03:00:55,541 INFO L226 Difference]: Without dead ends: 4526 [2019-10-03 03:00:55,542 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:00:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-10-03 03:00:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 1363. [2019-10-03 03:00:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-03 03:00:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2006 transitions. [2019-10-03 03:00:55,602 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2006 transitions. Word has length 59 [2019-10-03 03:00:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:55,602 INFO L475 AbstractCegarLoop]: Abstraction has 1363 states and 2006 transitions. [2019-10-03 03:00:55,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:00:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2006 transitions. [2019-10-03 03:00:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:00:55,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:55,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:55,604 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -157395530, now seen corresponding path program 1 times [2019-10-03 03:00:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:55,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:55,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:55,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:55,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:00:55,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:55,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:00:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:00:55,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:00:55,775 INFO L87 Difference]: Start difference. First operand 1363 states and 2006 transitions. Second operand 9 states. [2019-10-03 03:00:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:56,551 INFO L93 Difference]: Finished difference Result 5799 states and 8556 transitions. [2019-10-03 03:00:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:00:56,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-03 03:00:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:56,570 INFO L225 Difference]: With dead ends: 5799 [2019-10-03 03:00:56,570 INFO L226 Difference]: Without dead ends: 5799 [2019-10-03 03:00:56,571 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:00:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5799 states. [2019-10-03 03:00:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5799 to 3842. [2019-10-03 03:00:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2019-10-03 03:00:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5718 transitions. [2019-10-03 03:00:56,644 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5718 transitions. Word has length 59 [2019-10-03 03:00:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:56,644 INFO L475 AbstractCegarLoop]: Abstraction has 3842 states and 5718 transitions. [2019-10-03 03:00:56,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:00:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5718 transitions. [2019-10-03 03:00:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:00:56,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:56,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:56,647 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2127126793, now seen corresponding path program 1 times [2019-10-03 03:00:56,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:56,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:56,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:56,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:00:56,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:56,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:00:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:00:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:00:56,778 INFO L87 Difference]: Start difference. First operand 3842 states and 5718 transitions. Second operand 9 states. [2019-10-03 03:00:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:57,782 INFO L93 Difference]: Finished difference Result 16960 states and 25044 transitions. [2019-10-03 03:00:57,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:00:57,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-03 03:00:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:57,817 INFO L225 Difference]: With dead ends: 16960 [2019-10-03 03:00:57,817 INFO L226 Difference]: Without dead ends: 16960 [2019-10-03 03:00:57,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:00:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-10-03 03:00:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 11727. [2019-10-03 03:00:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-10-03 03:00:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 17416 transitions. [2019-10-03 03:00:58,039 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 17416 transitions. Word has length 59 [2019-10-03 03:00:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:58,039 INFO L475 AbstractCegarLoop]: Abstraction has 11727 states and 17416 transitions. [2019-10-03 03:00:58,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:00:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 17416 transitions. [2019-10-03 03:00:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:00:58,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:58,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:58,044 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1033600256, now seen corresponding path program 1 times [2019-10-03 03:00:58,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:58,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:58,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:58,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:58,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:58,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:00:58,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:58,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:00:58,149 INFO L87 Difference]: Start difference. First operand 11727 states and 17416 transitions. Second operand 6 states. [2019-10-03 03:00:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:58,403 INFO L93 Difference]: Finished difference Result 12940 states and 19105 transitions. [2019-10-03 03:00:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:58,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-03 03:00:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:58,435 INFO L225 Difference]: With dead ends: 12940 [2019-10-03 03:00:58,435 INFO L226 Difference]: Without dead ends: 12940 [2019-10-03 03:00:58,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:00:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2019-10-03 03:00:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 8396. [2019-10-03 03:00:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-10-03 03:00:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 12355 transitions. [2019-10-03 03:00:58,661 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 12355 transitions. Word has length 60 [2019-10-03 03:00:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:58,661 INFO L475 AbstractCegarLoop]: Abstraction has 8396 states and 12355 transitions. [2019-10-03 03:00:58,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 12355 transitions. [2019-10-03 03:00:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:00:58,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:58,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:58,665 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash -976844717, now seen corresponding path program 1 times [2019-10-03 03:00:58,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:58,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:58,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:58,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:58,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:00:58,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:58,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:58,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:58,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:00:58,773 INFO L87 Difference]: Start difference. First operand 8396 states and 12355 transitions. Second operand 6 states. [2019-10-03 03:00:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:59,045 INFO L93 Difference]: Finished difference Result 12331 states and 18133 transitions. [2019-10-03 03:00:59,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:59,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-03 03:00:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:59,066 INFO L225 Difference]: With dead ends: 12331 [2019-10-03 03:00:59,066 INFO L226 Difference]: Without dead ends: 12331 [2019-10-03 03:00:59,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:00:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12331 states. [2019-10-03 03:00:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12331 to 7655. [2019-10-03 03:00:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-03 03:00:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11188 transitions. [2019-10-03 03:00:59,199 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11188 transitions. Word has length 60 [2019-10-03 03:00:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:59,199 INFO L475 AbstractCegarLoop]: Abstraction has 7655 states and 11188 transitions. [2019-10-03 03:00:59,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11188 transitions. [2019-10-03 03:00:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:00:59,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:59,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:59,207 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1274910523, now seen corresponding path program 1 times [2019-10-03 03:00:59,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:59,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:59,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:59,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:59,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:59,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:59,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:00:59,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:59,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:00:59,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:00:59,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:00:59,264 INFO L87 Difference]: Start difference. First operand 7655 states and 11188 transitions. Second operand 5 states. [2019-10-03 03:00:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:59,528 INFO L93 Difference]: Finished difference Result 10932 states and 15754 transitions. [2019-10-03 03:00:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:59,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-03 03:00:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:59,563 INFO L225 Difference]: With dead ends: 10932 [2019-10-03 03:00:59,563 INFO L226 Difference]: Without dead ends: 10932 [2019-10-03 03:00:59,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:00:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2019-10-03 03:00:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 7655. [2019-10-03 03:00:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-03 03:00:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11084 transitions. [2019-10-03 03:00:59,843 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11084 transitions. Word has length 60 [2019-10-03 03:00:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:59,844 INFO L475 AbstractCegarLoop]: Abstraction has 7655 states and 11084 transitions. [2019-10-03 03:00:59,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:00:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11084 transitions. [2019-10-03 03:00:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:00:59,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:59,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:59,846 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:59,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1286220475, now seen corresponding path program 1 times [2019-10-03 03:00:59,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:59,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:59,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:59,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:59,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:59,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:59,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:00:59,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:59,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:00:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:00:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:00:59,925 INFO L87 Difference]: Start difference. First operand 7655 states and 11084 transitions. Second operand 5 states. [2019-10-03 03:01:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:00,044 INFO L93 Difference]: Finished difference Result 15928 states and 23181 transitions. [2019-10-03 03:01:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:00,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-03 03:01:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:00,066 INFO L225 Difference]: With dead ends: 15928 [2019-10-03 03:01:00,066 INFO L226 Difference]: Without dead ends: 15928 [2019-10-03 03:01:00,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15928 states. [2019-10-03 03:01:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15928 to 9395. [2019-10-03 03:01:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9395 states. [2019-10-03 03:01:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9395 states to 9395 states and 13659 transitions. [2019-10-03 03:01:00,239 INFO L78 Accepts]: Start accepts. Automaton has 9395 states and 13659 transitions. Word has length 61 [2019-10-03 03:01:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:00,239 INFO L475 AbstractCegarLoop]: Abstraction has 9395 states and 13659 transitions. [2019-10-03 03:01:00,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 9395 states and 13659 transitions. [2019-10-03 03:01:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:01:00,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:00,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:00,243 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:00,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash 740645981, now seen corresponding path program 1 times [2019-10-03 03:01:00,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:00,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:00,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:00,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:00,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:00,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:00,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:00,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:00,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:00,346 INFO L87 Difference]: Start difference. First operand 9395 states and 13659 transitions. Second operand 5 states. [2019-10-03 03:01:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:00,461 INFO L93 Difference]: Finished difference Result 17415 states and 25353 transitions. [2019-10-03 03:01:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:00,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-03 03:01:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:00,480 INFO L225 Difference]: With dead ends: 17415 [2019-10-03 03:01:00,480 INFO L226 Difference]: Without dead ends: 17415 [2019-10-03 03:01:00,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2019-10-03 03:01:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 11338. [2019-10-03 03:01:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-10-03 03:01:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 16529 transitions. [2019-10-03 03:01:00,640 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 16529 transitions. Word has length 61 [2019-10-03 03:01:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:00,640 INFO L475 AbstractCegarLoop]: Abstraction has 11338 states and 16529 transitions. [2019-10-03 03:01:00,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 16529 transitions. [2019-10-03 03:01:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 03:01:00,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:00,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:00,644 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1147863087, now seen corresponding path program 1 times [2019-10-03 03:01:00,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:00,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:00,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:00,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:00,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:01,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:01,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:01,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:01,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:01,097 INFO L87 Difference]: Start difference. First operand 11338 states and 16529 transitions. Second operand 3 states. [2019-10-03 03:01:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:01,157 INFO L93 Difference]: Finished difference Result 16793 states and 23919 transitions. [2019-10-03 03:01:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:01,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-03 03:01:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:01,177 INFO L225 Difference]: With dead ends: 16793 [2019-10-03 03:01:01,178 INFO L226 Difference]: Without dead ends: 16793 [2019-10-03 03:01:01,179 INFO L640 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-10-03 03:01:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-10-03 03:01:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 13747. [2019-10-03 03:01:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13747 states. [2019-10-03 03:01:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13747 states to 13747 states and 19699 transitions. [2019-10-03 03:01:01,313 INFO L78 Accepts]: Start accepts. Automaton has 13747 states and 19699 transitions. Word has length 64 [2019-10-03 03:01:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:01,313 INFO L475 AbstractCegarLoop]: Abstraction has 13747 states and 19699 transitions. [2019-10-03 03:01:01,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 13747 states and 19699 transitions. [2019-10-03 03:01:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 03:01:01,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:01,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:01,316 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2093601519, now seen corresponding path program 1 times [2019-10-03 03:01:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:01,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:01,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:01,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-10-03 03:01:01,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:01,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:01:01,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:01,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:01:01,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:01:01,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:01,406 INFO L87 Difference]: Start difference. First operand 13747 states and 19699 transitions. Second operand 7 states. [2019-10-03 03:01:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:01,995 INFO L93 Difference]: Finished difference Result 56579 states and 80469 transitions. [2019-10-03 03:01:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:01:01,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-10-03 03:01:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:02,060 INFO L225 Difference]: With dead ends: 56579 [2019-10-03 03:01:02,060 INFO L226 Difference]: Without dead ends: 56579 [2019-10-03 03:01:02,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:01:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56579 states. [2019-10-03 03:01:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56579 to 13825. [2019-10-03 03:01:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-10-03 03:01:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19799 transitions. [2019-10-03 03:01:02,491 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19799 transitions. Word has length 64 [2019-10-03 03:01:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:02,491 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 19799 transitions. [2019-10-03 03:01:02,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:01:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19799 transitions. [2019-10-03 03:01:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:01:02,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:02,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:02,495 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1818867674, now seen corresponding path program 1 times [2019-10-03 03:01:02,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:02,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:02,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:02,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:02,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:02,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:02,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:02,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:02,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:02,718 INFO L87 Difference]: Start difference. First operand 13825 states and 19799 transitions. Second operand 10 states. [2019-10-03 03:01:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:04,469 INFO L93 Difference]: Finished difference Result 36159 states and 51263 transitions. [2019-10-03 03:01:04,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:01:04,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-03 03:01:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:04,504 INFO L225 Difference]: With dead ends: 36159 [2019-10-03 03:01:04,504 INFO L226 Difference]: Without dead ends: 36159 [2019-10-03 03:01:04,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:01:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36159 states. [2019-10-03 03:01:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36159 to 13825. [2019-10-03 03:01:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-10-03 03:01:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19793 transitions. [2019-10-03 03:01:04,849 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19793 transitions. Word has length 66 [2019-10-03 03:01:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:04,850 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 19793 transitions. [2019-10-03 03:01:04,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19793 transitions. [2019-10-03 03:01:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:01:04,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:04,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:04,853 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1934158108, now seen corresponding path program 1 times [2019-10-03 03:01:04,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:04,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:04,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:04,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:04,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:05,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:05,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:05,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:05,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:05,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:05,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:05,034 INFO L87 Difference]: Start difference. First operand 13825 states and 19793 transitions. Second operand 10 states. [2019-10-03 03:01:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:06,684 INFO L93 Difference]: Finished difference Result 37943 states and 53872 transitions. [2019-10-03 03:01:06,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:01:06,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-03 03:01:06,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:06,718 INFO L225 Difference]: With dead ends: 37943 [2019-10-03 03:01:06,718 INFO L226 Difference]: Without dead ends: 37943 [2019-10-03 03:01:06,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:01:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37943 states. [2019-10-03 03:01:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37943 to 13608. [2019-10-03 03:01:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13608 states. [2019-10-03 03:01:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13608 states to 13608 states and 19479 transitions. [2019-10-03 03:01:07,577 INFO L78 Accepts]: Start accepts. Automaton has 13608 states and 19479 transitions. Word has length 66 [2019-10-03 03:01:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:07,578 INFO L475 AbstractCegarLoop]: Abstraction has 13608 states and 19479 transitions. [2019-10-03 03:01:07,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13608 states and 19479 transitions. [2019-10-03 03:01:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:01:07,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:07,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:07,581 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash 810899746, now seen corresponding path program 1 times [2019-10-03 03:01:07,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:07,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:07,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:07,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:07,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:07,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:07,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:07,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:07,783 INFO L87 Difference]: Start difference. First operand 13608 states and 19479 transitions. Second operand 10 states. [2019-10-03 03:01:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:09,852 INFO L93 Difference]: Finished difference Result 35496 states and 50349 transitions. [2019-10-03 03:01:09,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:01:09,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-03 03:01:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:09,886 INFO L225 Difference]: With dead ends: 35496 [2019-10-03 03:01:09,886 INFO L226 Difference]: Without dead ends: 35496 [2019-10-03 03:01:09,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:01:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35496 states. [2019-10-03 03:01:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35496 to 13474. [2019-10-03 03:01:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13474 states. [2019-10-03 03:01:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13474 states to 13474 states and 19278 transitions. [2019-10-03 03:01:10,096 INFO L78 Accepts]: Start accepts. Automaton has 13474 states and 19278 transitions. Word has length 66 [2019-10-03 03:01:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:10,097 INFO L475 AbstractCegarLoop]: Abstraction has 13474 states and 19278 transitions. [2019-10-03 03:01:10,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 13474 states and 19278 transitions. [2019-10-03 03:01:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:01:10,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:10,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:10,099 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:10,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1139713951, now seen corresponding path program 1 times [2019-10-03 03:01:10,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:10,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:10,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:10,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:10,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:10,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:10,155 INFO L87 Difference]: Start difference. First operand 13474 states and 19278 transitions. Second operand 3 states. [2019-10-03 03:01:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:10,226 INFO L93 Difference]: Finished difference Result 13476 states and 18962 transitions. [2019-10-03 03:01:10,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:10,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-03 03:01:10,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:10,248 INFO L225 Difference]: With dead ends: 13476 [2019-10-03 03:01:10,248 INFO L226 Difference]: Without dead ends: 13476 [2019-10-03 03:01:10,248 INFO L640 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-10-03 03:01:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13476 states. [2019-10-03 03:01:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13476 to 13474. [2019-10-03 03:01:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13474 states. [2019-10-03 03:01:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13474 states to 13474 states and 18961 transitions. [2019-10-03 03:01:10,586 INFO L78 Accepts]: Start accepts. Automaton has 13474 states and 18961 transitions. Word has length 67 [2019-10-03 03:01:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:10,586 INFO L475 AbstractCegarLoop]: Abstraction has 13474 states and 18961 transitions. [2019-10-03 03:01:10,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13474 states and 18961 transitions. [2019-10-03 03:01:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:01:10,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:10,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:10,591 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1374992007, now seen corresponding path program 1 times [2019-10-03 03:01:10,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:10,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:10,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:10,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:10,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:10,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:10,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:10,658 INFO L87 Difference]: Start difference. First operand 13474 states and 18961 transitions. Second operand 3 states. [2019-10-03 03:01:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:10,720 INFO L93 Difference]: Finished difference Result 12096 states and 16722 transitions. [2019-10-03 03:01:10,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:10,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-03 03:01:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:10,738 INFO L225 Difference]: With dead ends: 12096 [2019-10-03 03:01:10,738 INFO L226 Difference]: Without dead ends: 12096 [2019-10-03 03:01:10,738 INFO L640 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-10-03 03:01:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12096 states. [2019-10-03 03:01:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12096 to 12094. [2019-10-03 03:01:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12094 states. [2019-10-03 03:01:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12094 states to 12094 states and 16721 transitions. [2019-10-03 03:01:10,893 INFO L78 Accepts]: Start accepts. Automaton has 12094 states and 16721 transitions. Word has length 67 [2019-10-03 03:01:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:10,893 INFO L475 AbstractCegarLoop]: Abstraction has 12094 states and 16721 transitions. [2019-10-03 03:01:10,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12094 states and 16721 transitions. [2019-10-03 03:01:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:01:10,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:10,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:10,897 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash 731179949, now seen corresponding path program 1 times [2019-10-03 03:01:10,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:10,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:10,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:10,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:10,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:10,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:10,954 INFO L87 Difference]: Start difference. First operand 12094 states and 16721 transitions. Second operand 3 states. [2019-10-03 03:01:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:11,012 INFO L93 Difference]: Finished difference Result 10309 states and 13954 transitions. [2019-10-03 03:01:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:11,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-03 03:01:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:11,026 INFO L225 Difference]: With dead ends: 10309 [2019-10-03 03:01:11,026 INFO L226 Difference]: Without dead ends: 10309 [2019-10-03 03:01:11,027 INFO L640 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-10-03 03:01:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10309 states. [2019-10-03 03:01:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10309 to 10307. [2019-10-03 03:01:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10307 states. [2019-10-03 03:01:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10307 states to 10307 states and 13953 transitions. [2019-10-03 03:01:11,148 INFO L78 Accepts]: Start accepts. Automaton has 10307 states and 13953 transitions. Word has length 67 [2019-10-03 03:01:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:11,148 INFO L475 AbstractCegarLoop]: Abstraction has 10307 states and 13953 transitions. [2019-10-03 03:01:11,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 10307 states and 13953 transitions. [2019-10-03 03:01:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:01:11,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:11,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:11,153 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1663214200, now seen corresponding path program 1 times [2019-10-03 03:01:11,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:11,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:12,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:12,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-03 03:01:12,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:12,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:01:12,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:01:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:01:12,127 INFO L87 Difference]: Start difference. First operand 10307 states and 13953 transitions. Second operand 23 states. [2019-10-03 03:01:12,476 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-10-03 03:01:13,490 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-03 03:01:13,828 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:01:14,233 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-10-03 03:01:14,828 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-10-03 03:01:15,274 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-10-03 03:01:15,460 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:01:15,699 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:01:16,067 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-03 03:01:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:21,535 INFO L93 Difference]: Finished difference Result 37076 states and 50649 transitions. [2019-10-03 03:01:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:01:21,536 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-03 03:01:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:21,570 INFO L225 Difference]: With dead ends: 37076 [2019-10-03 03:01:21,571 INFO L226 Difference]: Without dead ends: 37076 [2019-10-03 03:01:21,572 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=455, Invalid=2197, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 03:01:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37076 states. [2019-10-03 03:01:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37076 to 10319. [2019-10-03 03:01:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10319 states. [2019-10-03 03:01:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10319 states to 10319 states and 13968 transitions. [2019-10-03 03:01:21,750 INFO L78 Accepts]: Start accepts. Automaton has 10319 states and 13968 transitions. Word has length 68 [2019-10-03 03:01:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:21,750 INFO L475 AbstractCegarLoop]: Abstraction has 10319 states and 13968 transitions. [2019-10-03 03:01:21,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:01:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 10319 states and 13968 transitions. [2019-10-03 03:01:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:01:21,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:21,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:21,752 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash 668370156, now seen corresponding path program 1 times [2019-10-03 03:01:21,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:21,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:21,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:22,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:22,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-03 03:01:22,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:22,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:01:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:01:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:01:22,487 INFO L87 Difference]: Start difference. First operand 10319 states and 13968 transitions. Second operand 23 states. [2019-10-03 03:01:22,716 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-10-03 03:01:23,877 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-03 03:01:24,306 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-03 03:01:24,582 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-03 03:01:25,342 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-03 03:01:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:29,638 INFO L93 Difference]: Finished difference Result 34783 states and 47519 transitions. [2019-10-03 03:01:29,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-03 03:01:29,639 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-03 03:01:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:29,675 INFO L225 Difference]: With dead ends: 34783 [2019-10-03 03:01:29,675 INFO L226 Difference]: Without dead ends: 34783 [2019-10-03 03:01:29,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=380, Invalid=1600, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 03:01:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34783 states. [2019-10-03 03:01:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34783 to 10301. [2019-10-03 03:01:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-10-03 03:01:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 13943 transitions. [2019-10-03 03:01:29,867 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 13943 transitions. Word has length 68 [2019-10-03 03:01:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:29,868 INFO L475 AbstractCegarLoop]: Abstraction has 10301 states and 13943 transitions. [2019-10-03 03:01:29,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:01:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 13943 transitions. [2019-10-03 03:01:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:01:29,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:29,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:29,870 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1249568560, now seen corresponding path program 1 times [2019-10-03 03:01:29,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:29,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:29,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:29,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:29,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:30,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:30,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-03 03:01:30,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:30,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:01:30,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:01:30,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:01:30,655 INFO L87 Difference]: Start difference. First operand 10301 states and 13943 transitions. Second operand 23 states. [2019-10-03 03:01:30,943 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-10-03 03:01:31,959 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-03 03:01:32,368 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-03 03:01:32,746 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:01:35,401 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-10-03 03:01:35,808 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-10-03 03:01:35,983 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:01:36,258 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:01:36,626 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-03 03:01:36,828 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-03 03:01:37,093 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:01:37,630 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-03 03:01:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:41,799 INFO L93 Difference]: Finished difference Result 46113 states and 63002 transitions. [2019-10-03 03:01:41,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:01:41,799 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-03 03:01:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:41,847 INFO L225 Difference]: With dead ends: 46113 [2019-10-03 03:01:41,847 INFO L226 Difference]: Without dead ends: 46113 [2019-10-03 03:01:41,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2019-10-03 03:01:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46113 states. [2019-10-03 03:01:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46113 to 10283. [2019-10-03 03:01:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10283 states. [2019-10-03 03:01:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10283 states to 10283 states and 13918 transitions. [2019-10-03 03:01:42,111 INFO L78 Accepts]: Start accepts. Automaton has 10283 states and 13918 transitions. Word has length 68 [2019-10-03 03:01:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:42,112 INFO L475 AbstractCegarLoop]: Abstraction has 10283 states and 13918 transitions. [2019-10-03 03:01:42,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:01:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 10283 states and 13918 transitions. [2019-10-03 03:01:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:01:42,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:42,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:42,114 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2039898992, now seen corresponding path program 1 times [2019-10-03 03:01:42,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:42,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:42,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:42,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:42,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:42,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:42,244 INFO L87 Difference]: Start difference. First operand 10283 states and 13918 transitions. Second operand 3 states. [2019-10-03 03:01:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:42,320 INFO L93 Difference]: Finished difference Result 15189 states and 20594 transitions. [2019-10-03 03:01:42,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:42,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-03 03:01:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:42,340 INFO L225 Difference]: With dead ends: 15189 [2019-10-03 03:01:42,340 INFO L226 Difference]: Without dead ends: 15189 [2019-10-03 03:01:42,340 INFO L640 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-10-03 03:01:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15189 states. [2019-10-03 03:01:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15189 to 10143. [2019-10-03 03:01:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10143 states. [2019-10-03 03:01:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10143 states to 10143 states and 13710 transitions. [2019-10-03 03:01:42,434 INFO L78 Accepts]: Start accepts. Automaton has 10143 states and 13710 transitions. Word has length 68 [2019-10-03 03:01:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:42,434 INFO L475 AbstractCegarLoop]: Abstraction has 10143 states and 13710 transitions. [2019-10-03 03:01:42,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 10143 states and 13710 transitions. [2019-10-03 03:01:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:01:42,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:42,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:42,436 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1357870159, now seen corresponding path program 1 times [2019-10-03 03:01:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:42,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:42,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:42,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:42,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:42,477 INFO L87 Difference]: Start difference. First operand 10143 states and 13710 transitions. Second operand 3 states. [2019-10-03 03:01:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:42,555 INFO L93 Difference]: Finished difference Result 14995 states and 20307 transitions. [2019-10-03 03:01:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:42,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-03 03:01:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:42,575 INFO L225 Difference]: With dead ends: 14995 [2019-10-03 03:01:42,575 INFO L226 Difference]: Without dead ends: 14995 [2019-10-03 03:01:42,575 INFO L640 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-10-03 03:01:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14995 states. [2019-10-03 03:01:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14995 to 9949. [2019-10-03 03:01:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9949 states. [2019-10-03 03:01:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9949 states to 9949 states and 13439 transitions. [2019-10-03 03:01:42,709 INFO L78 Accepts]: Start accepts. Automaton has 9949 states and 13439 transitions. Word has length 68 [2019-10-03 03:01:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:42,710 INFO L475 AbstractCegarLoop]: Abstraction has 9949 states and 13439 transitions. [2019-10-03 03:01:42,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 9949 states and 13439 transitions. [2019-10-03 03:01:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 03:01:42,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:42,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:42,712 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:42,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1380296776, now seen corresponding path program 1 times [2019-10-03 03:01:42,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:42,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:42,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:43,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:43,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 03:01:43,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:43,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:01:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:01:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:01:43,154 INFO L87 Difference]: Start difference. First operand 9949 states and 13439 transitions. Second operand 13 states. [2019-10-03 03:01:43,558 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-10-03 03:01:43,718 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-03 03:01:43,890 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-03 03:01:44,052 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-03 03:01:44,455 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-03 03:01:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:45,044 INFO L93 Difference]: Finished difference Result 27592 states and 37495 transitions. [2019-10-03 03:01:45,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:01:45,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-10-03 03:01:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:45,070 INFO L225 Difference]: With dead ends: 27592 [2019-10-03 03:01:45,070 INFO L226 Difference]: Without dead ends: 27592 [2019-10-03 03:01:45,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:01:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27592 states. [2019-10-03 03:01:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27592 to 9863. [2019-10-03 03:01:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9863 states. [2019-10-03 03:01:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 13329 transitions. [2019-10-03 03:01:45,222 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 13329 transitions. Word has length 69 [2019-10-03 03:01:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:45,222 INFO L475 AbstractCegarLoop]: Abstraction has 9863 states and 13329 transitions. [2019-10-03 03:01:45,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:01:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 13329 transitions. [2019-10-03 03:01:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 03:01:45,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:45,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:45,224 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash -662360376, now seen corresponding path program 1 times [2019-10-03 03:01:45,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:45,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:45,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:45,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:45,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:45,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 03:01:45,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:45,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:01:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:01:45,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:01:45,543 INFO L87 Difference]: Start difference. First operand 9863 states and 13329 transitions. Second operand 11 states. [2019-10-03 03:01:45,874 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-03 03:01:46,005 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:01:46,150 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:01:46,321 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:01:46,711 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:01:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:47,482 INFO L93 Difference]: Finished difference Result 24094 states and 32698 transitions. [2019-10-03 03:01:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:01:47,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-10-03 03:01:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:47,503 INFO L225 Difference]: With dead ends: 24094 [2019-10-03 03:01:47,504 INFO L226 Difference]: Without dead ends: 24094 [2019-10-03 03:01:47,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:01:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24094 states. [2019-10-03 03:01:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24094 to 9793. [2019-10-03 03:01:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9793 states. [2019-10-03 03:01:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9793 states to 9793 states and 13237 transitions. [2019-10-03 03:01:47,624 INFO L78 Accepts]: Start accepts. Automaton has 9793 states and 13237 transitions. Word has length 69 [2019-10-03 03:01:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:47,624 INFO L475 AbstractCegarLoop]: Abstraction has 9793 states and 13237 transitions. [2019-10-03 03:01:47,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:01:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9793 states and 13237 transitions. [2019-10-03 03:01:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 03:01:47,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:47,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:47,627 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:47,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash 941099548, now seen corresponding path program 1 times [2019-10-03 03:01:47,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:47,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:47,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:47,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:47,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:47,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:47,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:47,697 INFO L87 Difference]: Start difference. First operand 9793 states and 13237 transitions. Second operand 5 states. [2019-10-03 03:01:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:47,805 INFO L93 Difference]: Finished difference Result 9419 states and 12752 transitions. [2019-10-03 03:01:47,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:47,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-03 03:01:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:47,817 INFO L225 Difference]: With dead ends: 9419 [2019-10-03 03:01:47,817 INFO L226 Difference]: Without dead ends: 9419 [2019-10-03 03:01:47,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:47,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9419 states. [2019-10-03 03:01:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9419 to 9415. [2019-10-03 03:01:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9415 states. [2019-10-03 03:01:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9415 states to 9415 states and 12750 transitions. [2019-10-03 03:01:47,926 INFO L78 Accepts]: Start accepts. Automaton has 9415 states and 12750 transitions. Word has length 72 [2019-10-03 03:01:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:47,927 INFO L475 AbstractCegarLoop]: Abstraction has 9415 states and 12750 transitions. [2019-10-03 03:01:47,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9415 states and 12750 transitions. [2019-10-03 03:01:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 03:01:47,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:47,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:47,929 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1594855658, now seen corresponding path program 1 times [2019-10-03 03:01:47,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:47,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:47,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:47,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:48,001 INFO L87 Difference]: Start difference. First operand 9415 states and 12750 transitions. Second operand 6 states. [2019-10-03 03:01:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:48,111 INFO L93 Difference]: Finished difference Result 17837 states and 23741 transitions. [2019-10-03 03:01:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:48,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-10-03 03:01:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:48,128 INFO L225 Difference]: With dead ends: 17837 [2019-10-03 03:01:48,129 INFO L226 Difference]: Without dead ends: 17837 [2019-10-03 03:01:48,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17837 states. [2019-10-03 03:01:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17837 to 9730. [2019-10-03 03:01:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9730 states. [2019-10-03 03:01:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9730 states to 9730 states and 12980 transitions. [2019-10-03 03:01:48,232 INFO L78 Accepts]: Start accepts. Automaton has 9730 states and 12980 transitions. Word has length 75 [2019-10-03 03:01:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:48,232 INFO L475 AbstractCegarLoop]: Abstraction has 9730 states and 12980 transitions. [2019-10-03 03:01:48,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9730 states and 12980 transitions. [2019-10-03 03:01:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 03:01:48,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:48,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:48,235 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash -242700483, now seen corresponding path program 1 times [2019-10-03 03:01:48,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:48,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:48,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:48,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:48,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:48,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:48,279 INFO L87 Difference]: Start difference. First operand 9730 states and 12980 transitions. Second operand 3 states. [2019-10-03 03:01:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:48,330 INFO L93 Difference]: Finished difference Result 18047 states and 23754 transitions. [2019-10-03 03:01:48,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:48,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-03 03:01:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:48,351 INFO L225 Difference]: With dead ends: 18047 [2019-10-03 03:01:48,352 INFO L226 Difference]: Without dead ends: 18047 [2019-10-03 03:01:48,352 INFO L640 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-10-03 03:01:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18047 states. [2019-10-03 03:01:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18047 to 16903. [2019-10-03 03:01:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2019-10-03 03:01:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 22375 transitions. [2019-10-03 03:01:48,519 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 22375 transitions. Word has length 76 [2019-10-03 03:01:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:48,519 INFO L475 AbstractCegarLoop]: Abstraction has 16903 states and 22375 transitions. [2019-10-03 03:01:48,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 22375 transitions. [2019-10-03 03:01:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 03:01:48,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:48,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:48,521 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2061431257, now seen corresponding path program 1 times [2019-10-03 03:01:48,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:48,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:48,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:48,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:48,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:48,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:48,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:48,570 INFO L87 Difference]: Start difference. First operand 16903 states and 22375 transitions. Second operand 3 states. [2019-10-03 03:01:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:48,666 INFO L93 Difference]: Finished difference Result 31266 states and 40579 transitions. [2019-10-03 03:01:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:48,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-03 03:01:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:48,711 INFO L225 Difference]: With dead ends: 31266 [2019-10-03 03:01:48,712 INFO L226 Difference]: Without dead ends: 31266 [2019-10-03 03:01:48,713 INFO L640 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-10-03 03:01:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31266 states. [2019-10-03 03:01:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31266 to 29192. [2019-10-03 03:01:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29192 states. [2019-10-03 03:01:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29192 states to 29192 states and 38198 transitions. [2019-10-03 03:01:49,142 INFO L78 Accepts]: Start accepts. Automaton has 29192 states and 38198 transitions. Word has length 77 [2019-10-03 03:01:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:49,142 INFO L475 AbstractCegarLoop]: Abstraction has 29192 states and 38198 transitions. [2019-10-03 03:01:49,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29192 states and 38198 transitions. [2019-10-03 03:01:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 03:01:49,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:49,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:49,145 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash -936347122, now seen corresponding path program 1 times [2019-10-03 03:01:49,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:49,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:49,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:49,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:49,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:49,200 INFO L87 Difference]: Start difference. First operand 29192 states and 38198 transitions. Second operand 3 states. [2019-10-03 03:01:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:49,338 INFO L93 Difference]: Finished difference Result 43278 states and 55851 transitions. [2019-10-03 03:01:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:49,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-03 03:01:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:49,404 INFO L225 Difference]: With dead ends: 43278 [2019-10-03 03:01:49,404 INFO L226 Difference]: Without dead ends: 43278 [2019-10-03 03:01:49,405 INFO L640 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-10-03 03:01:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43278 states. [2019-10-03 03:01:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43278 to 43276. [2019-10-03 03:01:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43276 states. [2019-10-03 03:01:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43276 states to 43276 states and 55850 transitions. [2019-10-03 03:01:50,034 INFO L78 Accepts]: Start accepts. Automaton has 43276 states and 55850 transitions. Word has length 77 [2019-10-03 03:01:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:50,034 INFO L475 AbstractCegarLoop]: Abstraction has 43276 states and 55850 transitions. [2019-10-03 03:01:50,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 43276 states and 55850 transitions. [2019-10-03 03:01:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 03:01:50,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:50,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:50,037 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1962110619, now seen corresponding path program 1 times [2019-10-03 03:01:50,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:50,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:50,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:50,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:50,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:50,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:50,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:50,092 INFO L87 Difference]: Start difference. First operand 43276 states and 55850 transitions. Second operand 5 states. [2019-10-03 03:01:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:50,498 INFO L93 Difference]: Finished difference Result 77635 states and 96764 transitions. [2019-10-03 03:01:50,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:50,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-03 03:01:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:50,574 INFO L225 Difference]: With dead ends: 77635 [2019-10-03 03:01:50,574 INFO L226 Difference]: Without dead ends: 77635 [2019-10-03 03:01:50,575 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77635 states. [2019-10-03 03:01:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77635 to 48088. [2019-10-03 03:01:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48088 states. [2019-10-03 03:01:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48088 states to 48088 states and 61328 transitions. [2019-10-03 03:01:51,081 INFO L78 Accepts]: Start accepts. Automaton has 48088 states and 61328 transitions. Word has length 87 [2019-10-03 03:01:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:51,082 INFO L475 AbstractCegarLoop]: Abstraction has 48088 states and 61328 transitions. [2019-10-03 03:01:51,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 48088 states and 61328 transitions. [2019-10-03 03:01:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:01:51,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:51,086 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:51,086 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 408691093, now seen corresponding path program 1 times [2019-10-03 03:01:51,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:51,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:51,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:51,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:51,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:51,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:51,142 INFO L87 Difference]: Start difference. First operand 48088 states and 61328 transitions. Second operand 3 states. [2019-10-03 03:01:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:51,420 INFO L93 Difference]: Finished difference Result 90124 states and 111947 transitions. [2019-10-03 03:01:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:51,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-03 03:01:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:51,558 INFO L225 Difference]: With dead ends: 90124 [2019-10-03 03:01:51,559 INFO L226 Difference]: Without dead ends: 90124 [2019-10-03 03:01:51,560 INFO L640 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-10-03 03:01:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90124 states. [2019-10-03 03:01:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90124 to 78704. [2019-10-03 03:01:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78704 states. [2019-10-03 03:01:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78704 states to 78704 states and 98680 transitions. [2019-10-03 03:01:54,238 INFO L78 Accepts]: Start accepts. Automaton has 78704 states and 98680 transitions. Word has length 96 [2019-10-03 03:01:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:54,239 INFO L475 AbstractCegarLoop]: Abstraction has 78704 states and 98680 transitions. [2019-10-03 03:01:54,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 78704 states and 98680 transitions. [2019-10-03 03:01:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 03:01:54,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:54,246 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:01:54,246 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1281005310, now seen corresponding path program 1 times [2019-10-03 03:01:54,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:54,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:54,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:54,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:54,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:54,359 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-10-03 03:01:54,361 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [298], [303], [316], [318], [331], [339], [358], [369], [371], [374], [377], [380], [382], [384], [424], [437], [445], [458], [472], [484], [493], [509], [535], [557], [558], [562], [563], [564] [2019-10-03 03:01:54,415 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:01:54,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:01:54,598 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:55,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:55,027 INFO L272 AbstractInterpreter]: Visited 93 different actions 343 times. Merged at 33 different actions 221 times. Widened at 13 different actions 40 times. Performed 1301 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1301 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 8 different actions. Largest state had 123 variables. [2019-10-03 03:01:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:55,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:55,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:55,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:01:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:55,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:55,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:01:55,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:55,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:55,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:56,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:56,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11] total 24 [2019-10-03 03:01:56,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:56,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:01:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:01:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:01:56,327 INFO L87 Difference]: Start difference. First operand 78704 states and 98680 transitions. Second operand 15 states. [2019-10-03 03:01:59,091 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-03 03:01:59,773 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-10-03 03:02:00,218 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-03 03:02:00,633 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-03 03:02:01,017 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:02:01,393 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-03 03:02:02,142 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-03 03:02:02,411 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-03 03:02:03,196 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-03 03:02:03,554 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:02:05,665 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-03 03:02:05,851 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:02:06,192 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-03 03:02:06,694 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:02:06,989 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-03 03:02:08,130 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-10-03 03:02:08,456 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-03 03:02:09,011 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-03 03:02:09,602 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-10-03 03:02:10,585 WARN L191 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:02:10,773 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-03 03:02:11,277 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:02:11,458 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-10-03 03:02:11,786 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:02:12,230 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-03 03:02:12,824 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-03 03:02:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:13,188 INFO L93 Difference]: Finished difference Result 163201 states and 202201 transitions. [2019-10-03 03:02:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-03 03:02:13,188 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2019-10-03 03:02:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:13,525 INFO L225 Difference]: With dead ends: 163201 [2019-10-03 03:02:13,526 INFO L226 Difference]: Without dead ends: 163201 [2019-10-03 03:02:13,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 174 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1374, Invalid=5598, Unknown=0, NotChecked=0, Total=6972 [2019-10-03 03:02:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163201 states. [2019-10-03 03:02:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163201 to 137416. [2019-10-03 03:02:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137416 states. [2019-10-03 03:02:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137416 states to 137416 states and 171642 transitions. [2019-10-03 03:02:18,063 INFO L78 Accepts]: Start accepts. Automaton has 137416 states and 171642 transitions. Word has length 99 [2019-10-03 03:02:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:18,063 INFO L475 AbstractCegarLoop]: Abstraction has 137416 states and 171642 transitions. [2019-10-03 03:02:18,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:02:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 137416 states and 171642 transitions. [2019-10-03 03:02:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:02:18,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:18,093 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:02:18,093 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash 25351875, now seen corresponding path program 1 times [2019-10-03 03:02:18,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:18,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:18,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:02:18,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:18,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:02:18,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:18,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:02:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:02:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:02:18,147 INFO L87 Difference]: Start difference. First operand 137416 states and 171642 transitions. Second operand 4 states. [2019-10-03 03:02:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:18,705 INFO L93 Difference]: Finished difference Result 196901 states and 245418 transitions. [2019-10-03 03:02:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:18,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-03 03:02:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,004 INFO L225 Difference]: With dead ends: 196901 [2019-10-03 03:02:19,004 INFO L226 Difference]: Without dead ends: 196901 [2019-10-03 03:02:19,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196901 states. [2019-10-03 03:02:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196901 to 137359. [2019-10-03 03:02:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137359 states. [2019-10-03 03:02:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137359 states to 137359 states and 171581 transitions. [2019-10-03 03:02:21,203 INFO L78 Accepts]: Start accepts. Automaton has 137359 states and 171581 transitions. Word has length 109 [2019-10-03 03:02:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:21,203 INFO L475 AbstractCegarLoop]: Abstraction has 137359 states and 171581 transitions. [2019-10-03 03:02:21,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:02:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 137359 states and 171581 transitions. [2019-10-03 03:02:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:02:21,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:21,218 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:02:21,218 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -545064706, now seen corresponding path program 1 times [2019-10-03 03:02:21,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:21,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:21,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:21,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:21,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:21,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:21,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-10-03 03:02:21,278 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [261], [274], [287], [295], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [424], [437], [445], [472], [482], [535], [557], [558], [562], [563], [564] [2019-10-03 03:02:21,287 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:21,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:21,315 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:21,506 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:02:21,506 INFO L272 AbstractInterpreter]: Visited 99 different actions 291 times. Merged at 32 different actions 169 times. Widened at 10 different actions 15 times. Performed 1081 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1081 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 6 fixpoints after 4 different actions. Largest state had 125 variables. [2019-10-03 03:02:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:21,507 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:02:21,819 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 83.54% of their original sizes. [2019-10-03 03:02:21,819 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:02:26,479 INFO L420 sIntCurrentIteration]: We unified 108 AI predicates to 108 [2019-10-03 03:02:26,479 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:02:26,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:02:26,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [71] imperfect sequences [5] total 74 [2019-10-03 03:02:26,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:26,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-03 03:02:26,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-03 03:02:26,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=4653, Unknown=0, NotChecked=0, Total=4970 [2019-10-03 03:02:26,483 INFO L87 Difference]: Start difference. First operand 137359 states and 171581 transitions. Second operand 71 states. [2019-10-03 03:03:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:07,397 INFO L93 Difference]: Finished difference Result 176020 states and 219530 transitions. [2019-10-03 03:03:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-03 03:03:07,398 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 109 [2019-10-03 03:03:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:07,636 INFO L225 Difference]: With dead ends: 176020 [2019-10-03 03:03:07,637 INFO L226 Difference]: Without dead ends: 176020 [2019-10-03 03:03:07,643 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5779 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1402, Invalid=18338, Unknown=0, NotChecked=0, Total=19740 [2019-10-03 03:03:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176020 states. [2019-10-03 03:03:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176020 to 137449. [2019-10-03 03:03:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137449 states. [2019-10-03 03:03:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137449 states to 137449 states and 171665 transitions. [2019-10-03 03:03:09,154 INFO L78 Accepts]: Start accepts. Automaton has 137449 states and 171665 transitions. Word has length 109 [2019-10-03 03:03:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:09,154 INFO L475 AbstractCegarLoop]: Abstraction has 137449 states and 171665 transitions. [2019-10-03 03:03:09,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-03 03:03:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 137449 states and 171665 transitions. [2019-10-03 03:03:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 03:03:09,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:09,165 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:03:09,165 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash -252514300, now seen corresponding path program 1 times [2019-10-03 03:03:09,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:09,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:09,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:09,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:09,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:09,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:09,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:09,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-10-03 03:03:09,233 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [155], [158], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [261], [274], [287], [295], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [424], [437], [445], [451], [456], [472], [482], [535], [557], [558], [562], [563], [564] [2019-10-03 03:03:09,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:09,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:09,253 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:09,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:09,390 INFO L272 AbstractInterpreter]: Visited 101 different actions 354 times. Merged at 35 different actions 224 times. Widened at 14 different actions 36 times. Performed 1260 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1260 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 7 different actions. Largest state had 125 variables. [2019-10-03 03:03:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:09,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:09,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:09,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:03:09,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:09,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:09,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 03:03:09,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:10,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:10,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:10,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-10-03 03:03:10,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:10,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:10,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:03:10,555 INFO L87 Difference]: Start difference. First operand 137449 states and 171665 transitions. Second operand 10 states. [2019-10-03 03:03:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:11,647 INFO L93 Difference]: Finished difference Result 159272 states and 192224 transitions. [2019-10-03 03:03:11,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:03:11,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-10-03 03:03:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:11,833 INFO L225 Difference]: With dead ends: 159272 [2019-10-03 03:03:11,834 INFO L226 Difference]: Without dead ends: 159272 [2019-10-03 03:03:11,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:03:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159272 states. [2019-10-03 03:03:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159272 to 107404. [2019-10-03 03:03:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107404 states. [2019-10-03 03:03:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107404 states to 107404 states and 131830 transitions. [2019-10-03 03:03:12,950 INFO L78 Accepts]: Start accepts. Automaton has 107404 states and 131830 transitions. Word has length 110 [2019-10-03 03:03:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:12,951 INFO L475 AbstractCegarLoop]: Abstraction has 107404 states and 131830 transitions. [2019-10-03 03:03:12,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 107404 states and 131830 transitions. [2019-10-03 03:03:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:03:12,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:12,959 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:03:12,959 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1623155775, now seen corresponding path program 1 times [2019-10-03 03:03:12,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:12,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:12,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 03:03:13,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:13,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:03:13,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:13,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:03:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:03:13,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:03:13,015 INFO L87 Difference]: Start difference. First operand 107404 states and 131830 transitions. Second operand 4 states. [2019-10-03 03:03:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:13,423 INFO L93 Difference]: Finished difference Result 118510 states and 145177 transitions. [2019-10-03 03:03:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:13,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-03 03:03:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:13,539 INFO L225 Difference]: With dead ends: 118510 [2019-10-03 03:03:13,539 INFO L226 Difference]: Without dead ends: 118510 [2019-10-03 03:03:13,539 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118510 states. [2019-10-03 03:03:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118510 to 107404. [2019-10-03 03:03:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107404 states. [2019-10-03 03:03:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107404 states to 107404 states and 131830 transitions. [2019-10-03 03:03:15,010 INFO L78 Accepts]: Start accepts. Automaton has 107404 states and 131830 transitions. Word has length 111 [2019-10-03 03:03:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:15,011 INFO L475 AbstractCegarLoop]: Abstraction has 107404 states and 131830 transitions. [2019-10-03 03:03:15,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:03:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 107404 states and 131830 transitions. [2019-10-03 03:03:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:03:15,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:15,015 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:03:15,016 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash -357325210, now seen corresponding path program 1 times [2019-10-03 03:03:15,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:15,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:15,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:15,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:15,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:15,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:15,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:15,080 INFO L87 Difference]: Start difference. First operand 107404 states and 131830 transitions. Second operand 5 states. [2019-10-03 03:03:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:15,556 INFO L93 Difference]: Finished difference Result 133321 states and 160679 transitions. [2019-10-03 03:03:15,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:03:15,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-03 03:03:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:15,693 INFO L225 Difference]: With dead ends: 133321 [2019-10-03 03:03:15,693 INFO L226 Difference]: Without dead ends: 133321 [2019-10-03 03:03:15,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133321 states. [2019-10-03 03:03:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133321 to 103649. [2019-10-03 03:03:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103649 states. [2019-10-03 03:03:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103649 states to 103649 states and 125188 transitions. [2019-10-03 03:03:16,769 INFO L78 Accepts]: Start accepts. Automaton has 103649 states and 125188 transitions. Word has length 111 [2019-10-03 03:03:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:16,769 INFO L475 AbstractCegarLoop]: Abstraction has 103649 states and 125188 transitions. [2019-10-03 03:03:16,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 103649 states and 125188 transitions. [2019-10-03 03:03:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:03:16,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:16,777 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:03:16,777 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:16,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 233462571, now seen corresponding path program 1 times [2019-10-03 03:03:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:16,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:17,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:17,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:17,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-10-03 03:03:17,008 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [424], [427], [430], [433], [435], [437], [460], [470], [475], [478], [514], [530], [557], [558], [562], [563], [564] [2019-10-03 03:03:17,015 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:17,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:17,035 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:17,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:17,380 INFO L272 AbstractInterpreter]: Visited 107 different actions 480 times. Merged at 38 different actions 336 times. Widened at 15 different actions 61 times. Performed 1772 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1772 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 12 different actions. Largest state had 126 variables. [2019-10-03 03:03:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:17,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:17,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:17,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:03:17,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:17,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:18,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:03:18,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:18,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:18,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:19,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:19,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:03:19,885 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:19,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [10] total 35 [2019-10-03 03:03:19,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:19,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:03:19,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:03:19,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 03:03:19,889 INFO L87 Difference]: Start difference. First operand 103649 states and 125188 transitions. Second operand 15 states. [2019-10-03 03:03:20,063 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-10-03 03:03:23,620 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-03 03:03:24,585 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-03 03:03:26,155 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-03 03:03:26,668 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:03:26,871 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:03:27,463 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-03 03:03:28,723 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-03 03:03:29,394 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:03:30,154 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-03 03:03:30,437 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-03 03:03:30,828 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:03:31,242 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-03 03:03:32,742 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-03 03:03:33,175 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:03:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:33,956 INFO L93 Difference]: Finished difference Result 310468 states and 371802 transitions. [2019-10-03 03:03:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-03 03:03:33,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2019-10-03 03:03:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:34,310 INFO L225 Difference]: With dead ends: 310468 [2019-10-03 03:03:34,310 INFO L226 Difference]: Without dead ends: 310468 [2019-10-03 03:03:34,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 188 SyntacticMatches, 12 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1269, Invalid=5211, Unknown=0, NotChecked=0, Total=6480 [2019-10-03 03:03:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310468 states. [2019-10-03 03:03:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310468 to 133831. [2019-10-03 03:03:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133831 states. [2019-10-03 03:03:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133831 states to 133831 states and 161438 transitions. [2019-10-03 03:03:38,613 INFO L78 Accepts]: Start accepts. Automaton has 133831 states and 161438 transitions. Word has length 112 [2019-10-03 03:03:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:38,613 INFO L475 AbstractCegarLoop]: Abstraction has 133831 states and 161438 transitions. [2019-10-03 03:03:38,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:03:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 133831 states and 161438 transitions. [2019-10-03 03:03:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:03:38,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:38,619 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:03:38,620 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 316800099, now seen corresponding path program 1 times [2019-10-03 03:03:38,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:38,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:38,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:38,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:38,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:38,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 03:03:38,896 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [147], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [316], [318], [331], [339], [342], [345], [348], [350], [360], [363], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [458], [484], [493], [509], [557], [558], [562], [563], [564] [2019-10-03 03:03:38,898 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:38,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:38,910 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:39,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:39,092 INFO L272 AbstractInterpreter]: Visited 109 different actions 393 times. Merged at 41 different actions 260 times. Widened at 12 different actions 30 times. Performed 1459 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1459 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 7 different actions. Largest state had 126 variables. [2019-10-03 03:03:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:39,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:39,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:39,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:03:39,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:39,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:39,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:03:39,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:39,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:39,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:39,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:39,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:40,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:40,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-10-03 03:03:40,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:40,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-03 03:03:40,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-03 03:03:40,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:03:40,754 INFO L87 Difference]: Start difference. First operand 133831 states and 161438 transitions. Second operand 22 states. [2019-10-03 03:03:43,448 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-10-03 03:03:43,648 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-10-03 03:03:44,232 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-10-03 03:03:45,000 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-10-03 03:03:45,196 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-10-03 03:03:45,794 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-03 03:03:46,153 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-10-03 03:03:46,748 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-10-03 03:03:46,960 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-10-03 03:03:47,135 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-10-03 03:03:47,644 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-03 03:03:47,956 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-10-03 03:03:48,138 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-10-03 03:03:48,783 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-10-03 03:03:48,953 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2019-10-03 03:03:49,489 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-03 03:03:49,665 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-03 03:03:50,032 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-10-03 03:03:50,189 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-10-03 03:03:51,815 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-03 03:03:52,031 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-10-03 03:03:52,184 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-10-03 03:03:52,450 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-10-03 03:03:52,624 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-10-03 03:03:52,793 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-10-03 03:03:52,960 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-10-03 03:03:53,136 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-10-03 03:03:54,654 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-10-03 03:03:54,879 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-03 03:03:55,049 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-10-03 03:03:56,022 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-10-03 03:03:57,196 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-10-03 03:03:57,641 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-10-03 03:03:57,939 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-10-03 03:03:58,115 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-10-03 03:03:58,265 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-10-03 03:03:58,609 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-10-03 03:03:58,940 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-10-03 03:03:59,104 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2019-10-03 03:03:59,280 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-10-03 03:03:59,431 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-10-03 03:04:00,692 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-03 03:04:01,062 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-10-03 03:04:01,250 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-03 03:04:01,794 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 41 [2019-10-03 03:04:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:07,937 INFO L93 Difference]: Finished difference Result 579143 states and 690185 transitions. [2019-10-03 03:04:07,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-10-03 03:04:07,938 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 114 [2019-10-03 03:04:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:08,626 INFO L225 Difference]: With dead ends: 579143 [2019-10-03 03:04:08,626 INFO L226 Difference]: Without dead ends: 579143 [2019-10-03 03:04:08,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8781 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=5366, Invalid=22690, Unknown=0, NotChecked=0, Total=28056 [2019-10-03 03:04:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579143 states. [2019-10-03 03:04:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579143 to 134092. [2019-10-03 03:04:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134092 states. [2019-10-03 03:04:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134092 states to 134092 states and 161733 transitions. [2019-10-03 03:04:12,296 INFO L78 Accepts]: Start accepts. Automaton has 134092 states and 161733 transitions. Word has length 114 [2019-10-03 03:04:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:12,296 INFO L475 AbstractCegarLoop]: Abstraction has 134092 states and 161733 transitions. [2019-10-03 03:04:12,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-03 03:04:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 134092 states and 161733 transitions. [2019-10-03 03:04:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:04:12,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:12,300 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:12,301 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash 180935101, now seen corresponding path program 1 times [2019-10-03 03:04:12,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:12,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:12,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:12,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:12,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:12,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 03:04:12,568 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [424], [427], [430], [433], [435], [437], [460], [470], [514], [530], [557], [558], [562], [563], [564] [2019-10-03 03:04:12,570 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:12,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:12,580 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:12,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:12,832 INFO L272 AbstractInterpreter]: Visited 109 different actions 532 times. Merged at 41 different actions 386 times. Widened at 15 different actions 74 times. Performed 1886 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1886 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 11 different actions. Largest state had 126 variables. [2019-10-03 03:04:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:12,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:12,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:12,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:04:12,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:12,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:13,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:04:13,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:13,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:13,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:13,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:14,150 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:04:14,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-10-03 03:04:14,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:14,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:04:14,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:04:14,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:04:14,152 INFO L87 Difference]: Start difference. First operand 134092 states and 161733 transitions. Second operand 12 states. [2019-10-03 03:04:17,219 WARN L191 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-10-03 03:04:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:17,613 INFO L93 Difference]: Finished difference Result 161889 states and 194229 transitions. [2019-10-03 03:04:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:04:17,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-10-03 03:04:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:17,773 INFO L225 Difference]: With dead ends: 161889 [2019-10-03 03:04:17,774 INFO L226 Difference]: Without dead ends: 161889 [2019-10-03 03:04:17,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=320, Invalid=1936, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 03:04:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161889 states. [2019-10-03 03:04:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161889 to 152157. [2019-10-03 03:04:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152157 states. [2019-10-03 03:04:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152157 states to 152157 states and 183280 transitions. [2019-10-03 03:04:19,058 INFO L78 Accepts]: Start accepts. Automaton has 152157 states and 183280 transitions. Word has length 114 [2019-10-03 03:04:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:19,058 INFO L475 AbstractCegarLoop]: Abstraction has 152157 states and 183280 transitions. [2019-10-03 03:04:19,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:04:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 152157 states and 183280 transitions. [2019-10-03 03:04:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:04:19,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:19,063 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:19,063 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:19,064 INFO L82 PathProgramCache]: Analyzing trace with hash 474508797, now seen corresponding path program 1 times [2019-10-03 03:04:19,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:19,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:19,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:19,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:19,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:19,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:19,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:19,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 03:04:19,453 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [424], [427], [430], [433], [435], [437], [460], [470], [475], [478], [514], [530], [557], [558], [562], [563], [564] [2019-10-03 03:04:19,456 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:19,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:19,473 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:19,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:19,741 INFO L272 AbstractInterpreter]: Visited 109 different actions 504 times. Merged at 40 different actions 360 times. Widened at 15 different actions 68 times. Performed 1816 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1816 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 15 different actions. Largest state had 126 variables. [2019-10-03 03:04:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:19,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:19,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:19,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:04:19,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:19,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:19,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 03:04:19,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:20,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:20,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:20,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Abandoning pump threads because process wont die! [2019-10-03 03:04:21,278 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:04:21,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [12] total 31 [2019-10-03 03:04:21,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:21,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:04:21,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:04:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:04:21,279 INFO L87 Difference]: Start difference. First operand 152157 states and 183280 transitions. Second operand 12 states. [2019-10-03 03:04:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:23,279 INFO L93 Difference]: Finished difference Result 167598 states and 200467 transitions. [2019-10-03 03:04:23,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:04:23,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-10-03 03:04:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:23,481 INFO L225 Difference]: With dead ends: 167598 [2019-10-03 03:04:23,482 INFO L226 Difference]: Without dead ends: 167598 [2019-10-03 03:04:23,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=329, Invalid=1833, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 03:04:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167598 states. [2019-10-03 03:04:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167598 to 152157. [2019-10-03 03:04:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152157 states. [2019-10-03 03:04:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152157 states to 152157 states and 183104 transitions. [2019-10-03 03:04:24,842 INFO L78 Accepts]: Start accepts. Automaton has 152157 states and 183104 transitions. Word has length 114 [2019-10-03 03:04:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:24,843 INFO L475 AbstractCegarLoop]: Abstraction has 152157 states and 183104 transitions. [2019-10-03 03:04:24,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:04:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 152157 states and 183104 transitions. [2019-10-03 03:04:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 03:04:24,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:24,850 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:24,850 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:24,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1713567929, now seen corresponding path program 1 times [2019-10-03 03:04:24,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:24,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:25,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:25,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-10-03 03:04:25,062 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [424], [427], [430], [433], [435], [437], [460], [470], [475], [480], [514], [530], [557], [558], [562], [563], [564] [2019-10-03 03:04:25,064 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:25,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:25,077 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:25,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:25,423 INFO L272 AbstractInterpreter]: Visited 110 different actions 517 times. Merged at 41 different actions 371 times. Widened at 15 different actions 65 times. Performed 1816 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1816 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 10 different actions. Largest state had 126 variables. [2019-10-03 03:04:25,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:25,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:25,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:25,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:04:25,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:25,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:28,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-03 03:04:28,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:28,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:28,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:28,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:29,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:29,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:29,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:29,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:29,311 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:04:29,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [10] total 31 [2019-10-03 03:04:29,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:29,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:04:29,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:04:29,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:04:29,312 INFO L87 Difference]: Start difference. First operand 152157 states and 183104 transitions. Second operand 13 states. [2019-10-03 03:04:30,864 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-10-03 03:04:31,018 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-10-03 03:04:31,338 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-10-03 03:04:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:31,726 INFO L93 Difference]: Finished difference Result 166905 states and 200026 transitions. [2019-10-03 03:04:31,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 03:04:31,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2019-10-03 03:04:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:31,911 INFO L225 Difference]: With dead ends: 166905 [2019-10-03 03:04:31,911 INFO L226 Difference]: Without dead ends: 166905 [2019-10-03 03:04:31,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=368, Invalid=1888, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 03:04:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166905 states. [2019-10-03 03:04:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166905 to 157171. [2019-10-03 03:04:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157171 states. [2019-10-03 03:04:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157171 states to 157171 states and 189076 transitions. [2019-10-03 03:04:33,910 INFO L78 Accepts]: Start accepts. Automaton has 157171 states and 189076 transitions. Word has length 115 [2019-10-03 03:04:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:33,910 INFO L475 AbstractCegarLoop]: Abstraction has 157171 states and 189076 transitions. [2019-10-03 03:04:33,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:04:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 157171 states and 189076 transitions. [2019-10-03 03:04:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 03:04:33,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:33,917 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:33,917 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1004390060, now seen corresponding path program 1 times [2019-10-03 03:04:33,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:33,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:33,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:33,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:33,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:33,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:33,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:04:33,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:33,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:04:33,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:04:33,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:33,978 INFO L87 Difference]: Start difference. First operand 157171 states and 189076 transitions. Second operand 3 states. [2019-10-03 03:04:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:34,296 INFO L93 Difference]: Finished difference Result 107802 states and 125838 transitions. [2019-10-03 03:04:34,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:04:34,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-03 03:04:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:34,427 INFO L225 Difference]: With dead ends: 107802 [2019-10-03 03:04:34,427 INFO L226 Difference]: Without dead ends: 107802 [2019-10-03 03:04:34,427 INFO L640 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-10-03 03:04:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107802 states. [2019-10-03 03:04:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107802 to 103948. [2019-10-03 03:04:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103948 states. [2019-10-03 03:04:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103948 states to 103948 states and 121919 transitions. [2019-10-03 03:04:35,228 INFO L78 Accepts]: Start accepts. Automaton has 103948 states and 121919 transitions. Word has length 115 [2019-10-03 03:04:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:35,228 INFO L475 AbstractCegarLoop]: Abstraction has 103948 states and 121919 transitions. [2019-10-03 03:04:35,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:04:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 103948 states and 121919 transitions. [2019-10-03 03:04:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 03:04:35,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:35,234 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:35,234 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash -981600503, now seen corresponding path program 1 times [2019-10-03 03:04:35,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:35,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:35,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:35,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:35,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:35,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:35,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:35,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-10-03 03:04:35,443 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [424], [427], [430], [433], [435], [437], [460], [470], [475], [478], [514], [530], [557], [558], [562], [563], [564] [2019-10-03 03:04:35,444 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:35,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:35,454 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:35,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:35,644 INFO L272 AbstractInterpreter]: Visited 110 different actions 478 times. Merged at 41 different actions 336 times. Widened at 15 different actions 57 times. Performed 1741 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1741 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 13 different actions. Largest state had 126 variables. [2019-10-03 03:04:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:35,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:35,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:35,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:04:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:35,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:35,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:04:35,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:36,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:37,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:37,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:37,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-10-03 03:04:37,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:37,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:04:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:04:37,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:04:37,373 INFO L87 Difference]: Start difference. First operand 103948 states and 121919 transitions. Second operand 19 states. [2019-10-03 03:04:37,767 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:04:38,050 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-03 03:04:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:42,006 INFO L93 Difference]: Finished difference Result 238927 states and 279268 transitions. [2019-10-03 03:04:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:04:42,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2019-10-03 03:04:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:42,239 INFO L225 Difference]: With dead ends: 238927 [2019-10-03 03:04:42,239 INFO L226 Difference]: Without dead ends: 238927 [2019-10-03 03:04:42,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 197 SyntacticMatches, 20 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 03:04:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238927 states. [2019-10-03 03:04:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238927 to 103787. [2019-10-03 03:04:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103787 states. [2019-10-03 03:04:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103787 states to 103787 states and 121723 transitions. [2019-10-03 03:04:43,541 INFO L78 Accepts]: Start accepts. Automaton has 103787 states and 121723 transitions. Word has length 115 [2019-10-03 03:04:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:43,541 INFO L475 AbstractCegarLoop]: Abstraction has 103787 states and 121723 transitions. [2019-10-03 03:04:43,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:04:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 103787 states and 121723 transitions. [2019-10-03 03:04:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:04:43,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:43,544 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:43,544 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1885045069, now seen corresponding path program 1 times [2019-10-03 03:04:43,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:43,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:43,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:43,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:43,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:43,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:43,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:43,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-10-03 03:04:43,896 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [108], [111], [114], [118], [121], [124], [135], [138], [141], [144], [149], [152], [155], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [314], [318], [331], [339], [342], [345], [348], [350], [360], [363], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [458], [463], [468], [484], [493], [509], [557], [558], [562], [563], [564] [2019-10-03 03:04:43,900 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:43,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:43,911 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:44,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:44,449 INFO L272 AbstractInterpreter]: Visited 111 different actions 372 times. Merged at 42 different actions 238 times. Widened at 11 different actions 22 times. Performed 1374 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1374 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 126 variables. [2019-10-03 03:04:44,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:44,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:44,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:44,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:04:44,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:44,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:44,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 03:04:44,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:44,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:44,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:44,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:46,237 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-10-03 03:04:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:46,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:46,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:46,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:46,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:46,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 28 [2019-10-03 03:04:46,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:46,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-03 03:04:46,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-03 03:04:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-10-03 03:04:46,458 INFO L87 Difference]: Start difference. First operand 103787 states and 121723 transitions. Second operand 27 states. [2019-10-03 03:04:48,417 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-10-03 03:04:48,672 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-10-03 03:04:48,957 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-10-03 03:04:49,195 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-03 03:04:49,660 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-10-03 03:04:50,480 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-03 03:04:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:52,724 INFO L93 Difference]: Finished difference Result 337116 states and 393348 transitions. [2019-10-03 03:04:52,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-03 03:04:52,724 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 116 [2019-10-03 03:04:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:53,095 INFO L225 Difference]: With dead ends: 337116 [2019-10-03 03:04:53,096 INFO L226 Difference]: Without dead ends: 337116 [2019-10-03 03:04:53,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 202 SyntacticMatches, 21 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=536, Invalid=2544, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 03:04:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337116 states. [2019-10-03 03:04:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337116 to 103569. [2019-10-03 03:04:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103569 states. [2019-10-03 03:04:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103569 states to 103569 states and 121469 transitions. [2019-10-03 03:04:57,684 INFO L78 Accepts]: Start accepts. Automaton has 103569 states and 121469 transitions. Word has length 116 [2019-10-03 03:04:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:57,684 INFO L475 AbstractCegarLoop]: Abstraction has 103569 states and 121469 transitions. [2019-10-03 03:04:57,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-03 03:04:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 103569 states and 121469 transitions. [2019-10-03 03:04:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:04:57,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:57,687 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:57,688 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1764102859, now seen corresponding path program 1 times [2019-10-03 03:04:57,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:57,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:57,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:57,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:57,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:57,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:57,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:04:57,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:57,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:04:57,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:04:57,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:57,739 INFO L87 Difference]: Start difference. First operand 103569 states and 121469 transitions. Second operand 3 states. [2019-10-03 03:04:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:58,140 INFO L93 Difference]: Finished difference Result 127077 states and 147706 transitions. [2019-10-03 03:04:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:04:58,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-03 03:04:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:58,295 INFO L225 Difference]: With dead ends: 127077 [2019-10-03 03:04:58,295 INFO L226 Difference]: Without dead ends: 127077 [2019-10-03 03:04:58,295 INFO L640 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-10-03 03:04:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127077 states. [2019-10-03 03:04:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127077 to 105501. [2019-10-03 03:04:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105501 states. [2019-10-03 03:04:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105501 states to 105501 states and 122837 transitions. [2019-10-03 03:04:59,870 INFO L78 Accepts]: Start accepts. Automaton has 105501 states and 122837 transitions. Word has length 116 [2019-10-03 03:04:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:59,870 INFO L475 AbstractCegarLoop]: Abstraction has 105501 states and 122837 transitions. [2019-10-03 03:04:59,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:04:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 105501 states and 122837 transitions. [2019-10-03 03:04:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:04:59,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:59,874 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:04:59,874 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:59,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:59,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1374034335, now seen corresponding path program 1 times [2019-10-03 03:04:59,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:59,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:05:00,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:00,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 03:05:00,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:00,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:05:00,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:05:00,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:05:00,334 INFO L87 Difference]: Start difference. First operand 105501 states and 122837 transitions. Second operand 13 states. [2019-10-03 03:05:01,001 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:05:01,226 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-03 03:05:01,451 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-03 03:05:01,682 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-03 03:05:01,943 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:05:02,160 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-03 03:05:02,393 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-03 03:05:02,599 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-03 03:05:02,966 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-10-03 03:05:03,298 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-03 03:05:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:03,992 INFO L93 Difference]: Finished difference Result 254685 states and 297192 transitions. [2019-10-03 03:05:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:05:03,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2019-10-03 03:05:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:04,267 INFO L225 Difference]: With dead ends: 254685 [2019-10-03 03:05:04,267 INFO L226 Difference]: Without dead ends: 254685 [2019-10-03 03:05:04,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:05:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254685 states. [2019-10-03 03:05:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254685 to 94837. [2019-10-03 03:05:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94837 states. [2019-10-03 03:05:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94837 states to 94837 states and 110489 transitions. [2019-10-03 03:05:08,207 INFO L78 Accepts]: Start accepts. Automaton has 94837 states and 110489 transitions. Word has length 116 [2019-10-03 03:05:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:08,207 INFO L475 AbstractCegarLoop]: Abstraction has 94837 states and 110489 transitions. [2019-10-03 03:05:08,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:05:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 94837 states and 110489 transitions. [2019-10-03 03:05:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 03:05:08,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:08,210 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:05:08,210 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash 616688292, now seen corresponding path program 1 times [2019-10-03 03:05:08,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:08,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:08,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:08,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:08,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:05:08,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:08,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:05:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:05:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:05:08,696 INFO L87 Difference]: Start difference. First operand 94837 states and 110489 transitions. Second operand 19 states. [2019-10-03 03:05:08,848 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-03 03:05:09,233 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-03 03:05:09,560 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-03 03:05:09,780 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:05:10,187 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-03 03:05:10,447 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-03 03:05:10,656 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-03 03:05:10,932 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-03 03:05:11,219 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-03 03:05:11,396 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:05:11,578 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-03 03:05:11,764 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-10-03 03:05:12,318 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-10-03 03:05:13,978 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-03 03:05:15,071 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:05:15,426 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-03 03:05:15,729 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-10-03 03:05:16,163 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-03 03:05:16,330 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:05:17,019 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-10-03 03:05:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:21,693 INFO L93 Difference]: Finished difference Result 217980 states and 254659 transitions. [2019-10-03 03:05:21,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-03 03:05:21,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 118 [2019-10-03 03:05:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:21,951 INFO L225 Difference]: With dead ends: 217980 [2019-10-03 03:05:21,952 INFO L226 Difference]: Without dead ends: 217980 [2019-10-03 03:05:21,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1477, Invalid=7453, Unknown=0, NotChecked=0, Total=8930 [2019-10-03 03:05:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217980 states. [2019-10-03 03:05:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217980 to 105535. [2019-10-03 03:05:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105535 states. [2019-10-03 03:05:23,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105535 states to 105535 states and 123018 transitions. [2019-10-03 03:05:23,305 INFO L78 Accepts]: Start accepts. Automaton has 105535 states and 123018 transitions. Word has length 118 [2019-10-03 03:05:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:23,305 INFO L475 AbstractCegarLoop]: Abstraction has 105535 states and 123018 transitions. [2019-10-03 03:05:23,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:05:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 105535 states and 123018 transitions. [2019-10-03 03:05:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 03:05:23,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:23,308 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:05:23,308 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash -132390513, now seen corresponding path program 1 times [2019-10-03 03:05:23,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:23,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:23,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:23,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:23,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:23,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:23,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:05:23,819 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-10-03 03:05:23,819 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [557], [558], [562], [563], [564] [2019-10-03 03:05:23,823 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:05:23,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:05:23,834 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:05:24,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:05:24,519 INFO L272 AbstractInterpreter]: Visited 113 different actions 539 times. Merged at 40 different actions 387 times. Widened at 15 different actions 80 times. Performed 1997 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1997 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 14 different actions. Largest state had 127 variables. [2019-10-03 03:05:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:24,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:05:24,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:24,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:05:24,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:24,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:05:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:24,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 03:05:24,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:05:24,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:25,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:05:25,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:28,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:29,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:05:29,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 34 [2019-10-03 03:05:29,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:05:29,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-03 03:05:29,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-03 03:05:29,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 03:05:29,157 INFO L87 Difference]: Start difference. First operand 105535 states and 123018 transitions. Second operand 28 states. [2019-10-03 03:05:29,432 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-10-03 03:05:30,300 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-10-03 03:05:30,846 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-10-03 03:05:31,313 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-10-03 03:05:31,799 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:05:32,142 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-03 03:05:32,441 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:05:32,868 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-10-03 03:05:33,209 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:05:34,147 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-10-03 03:05:34,725 WARN L191 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2019-10-03 03:05:35,115 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2019-10-03 03:05:35,747 WARN L191 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-10-03 03:05:36,175 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-10-03 03:05:36,723 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-10-03 03:05:37,122 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-03 03:05:37,694 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 113 [2019-10-03 03:05:38,422 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-10-03 03:05:41,318 WARN L191 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2019-10-03 03:05:41,797 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-10-03 03:05:42,295 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-10-03 03:05:42,949 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-10-03 03:05:43,178 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-03 03:05:43,897 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-10-03 03:05:44,690 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:05:45,542 WARN L191 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-10-03 03:05:45,771 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-10-03 03:05:46,124 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-03 03:05:46,424 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-10-03 03:05:47,031 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-03 03:05:47,433 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-10-03 03:05:47,769 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-03 03:05:48,031 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-03 03:05:48,386 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-10-03 03:05:48,820 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-03 03:05:49,155 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:05:49,718 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:05:50,127 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-10-03 03:05:50,869 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-10-03 03:05:51,361 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-10-03 03:05:51,729 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-10-03 03:05:52,432 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:05:53,024 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-10-03 03:05:53,691 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-10-03 03:05:54,155 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-03 03:05:54,662 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-10-03 03:05:55,199 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-03 03:05:55,653 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2019-10-03 03:05:55,982 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-10-03 03:05:58,388 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 113 DAG size of output: 108 [2019-10-03 03:05:58,797 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-10-03 03:05:59,106 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-10-03 03:06:01,961 WARN L191 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:06:02,563 WARN L191 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-10-03 03:06:02,921 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-10-03 03:06:03,331 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:06:03,821 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-03 03:06:04,571 WARN L191 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 116 [2019-10-03 03:06:05,023 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:06:05,391 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-10-03 03:06:06,141 WARN L191 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2019-10-03 03:06:06,534 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-10-03 03:06:06,876 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-10-03 03:06:07,514 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2019-10-03 03:06:08,414 WARN L191 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-10-03 03:06:08,896 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-10-03 03:06:11,655 WARN L191 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-10-03 03:06:12,638 WARN L191 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:06:13,477 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-03 03:06:13,711 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:06:14,200 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-10-03 03:06:14,614 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-10-03 03:06:14,941 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:06:15,500 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-03 03:06:15,842 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-10-03 03:06:16,814 WARN L191 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:06:17,136 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:06:17,650 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:06:18,091 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-03 03:06:18,830 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-10-03 03:06:19,297 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2019-10-03 03:06:19,843 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-10-03 03:06:20,355 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-10-03 03:06:20,796 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-03 03:06:21,534 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:06:21,895 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-03 03:06:22,286 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-10-03 03:06:22,683 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-10-03 03:06:23,199 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-03 03:06:23,882 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-10-03 03:06:24,568 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-03 03:06:24,951 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-10-03 03:06:26,020 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:06:26,338 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-10-03 03:06:26,738 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-03 03:06:27,084 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-03 03:06:27,653 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-10-03 03:06:27,884 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-03 03:06:28,242 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-10-03 03:06:28,735 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-10-03 03:06:29,114 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-03 03:06:29,586 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:06:29,947 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-03 03:06:31,278 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-10-03 03:06:32,162 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-10-03 03:06:32,682 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-10-03 03:06:33,097 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-10-03 03:06:33,635 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-10-03 03:06:34,149 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-03 03:06:34,708 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-10-03 03:06:35,345 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2019-10-03 03:06:35,730 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-10-03 03:06:36,316 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 110 [2019-10-03 03:06:36,618 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-03 03:06:37,068 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:06:37,613 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-03 03:06:38,066 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-03 03:06:38,403 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-10-03 03:06:38,864 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-03 03:06:39,426 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:06:40,016 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2019-10-03 03:06:41,429 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-10-03 03:06:41,870 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-03 03:06:42,194 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-03 03:06:42,689 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:06:43,390 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-03 03:06:44,008 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-10-03 03:06:44,403 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-03 03:06:45,278 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-03 03:06:45,706 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-10-03 03:06:46,061 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-10-03 03:06:46,656 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-10-03 03:06:47,064 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-10-03 03:06:47,328 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-03 03:06:48,193 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-10-03 03:06:48,465 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-10-03 03:06:49,186 WARN L191 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-10-03 03:06:49,651 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-10-03 03:06:50,185 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-10-03 03:06:50,579 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-10-03 03:06:51,413 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2019-10-03 03:06:51,711 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-03 03:06:52,020 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-03 03:06:52,372 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-10-03 03:06:52,945 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 111 [2019-10-03 03:06:53,360 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-03 03:06:53,899 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-10-03 03:06:54,591 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-10-03 03:06:55,460 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-03 03:06:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:55,912 INFO L93 Difference]: Finished difference Result 276065 states and 318464 transitions. [2019-10-03 03:06:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-10-03 03:06:55,913 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2019-10-03 03:06:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:56,171 INFO L225 Difference]: With dead ends: 276065 [2019-10-03 03:06:56,171 INFO L226 Difference]: Without dead ends: 276065 [2019-10-03 03:06:56,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 188 SyntacticMatches, 34 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13418 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=5971, Invalid=28811, Unknown=0, NotChecked=0, Total=34782 [2019-10-03 03:06:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276065 states. [2019-10-03 03:06:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276065 to 105492. [2019-10-03 03:06:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105492 states. [2019-10-03 03:06:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105492 states to 105492 states and 122963 transitions. [2019-10-03 03:06:58,313 INFO L78 Accepts]: Start accepts. Automaton has 105492 states and 122963 transitions. Word has length 118 [2019-10-03 03:06:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:58,313 INFO L475 AbstractCegarLoop]: Abstraction has 105492 states and 122963 transitions. [2019-10-03 03:06:58,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-03 03:06:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 105492 states and 122963 transitions. [2019-10-03 03:06:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 03:06:58,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:58,317 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:06:58,317 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash -120238324, now seen corresponding path program 1 times [2019-10-03 03:06:58,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:58,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:58,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:58,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:58,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:06:58,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:58,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:06:58,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:06:58,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:06:58,620 INFO L87 Difference]: Start difference. First operand 105492 states and 122963 transitions. Second operand 12 states. [2019-10-03 03:07:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:01,264 INFO L93 Difference]: Finished difference Result 144691 states and 168852 transitions. [2019-10-03 03:07:01,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:07:01,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2019-10-03 03:07:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:01,387 INFO L225 Difference]: With dead ends: 144691 [2019-10-03 03:07:01,388 INFO L226 Difference]: Without dead ends: 144691 [2019-10-03 03:07:01,388 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:07:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144691 states. [2019-10-03 03:07:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144691 to 105123. [2019-10-03 03:07:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105123 states. [2019-10-03 03:07:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105123 states to 105123 states and 122541 transitions. [2019-10-03 03:07:04,890 INFO L78 Accepts]: Start accepts. Automaton has 105123 states and 122541 transitions. Word has length 119 [2019-10-03 03:07:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:04,890 INFO L475 AbstractCegarLoop]: Abstraction has 105123 states and 122541 transitions. [2019-10-03 03:07:04,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:07:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 105123 states and 122541 transitions. [2019-10-03 03:07:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 03:07:04,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:04,895 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:07:04,895 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash -362707694, now seen corresponding path program 1 times [2019-10-03 03:07:04,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:04,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:04,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:05,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:05,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:05,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-10-03 03:07:05,390 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [557], [558], [562], [563], [564] [2019-10-03 03:07:05,394 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:05,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:05,404 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:05,553 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:05,553 INFO L272 AbstractInterpreter]: Visited 115 different actions 400 times. Merged at 42 different actions 262 times. Widened at 10 different actions 24 times. Performed 1494 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1494 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 9 different actions. Largest state had 127 variables. [2019-10-03 03:07:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:05,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:05,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:05,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:07:05,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:05,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:05,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-03 03:07:05,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:06,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:06,746 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-10-03 03:07:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:07:06,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:07:07,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:07:07,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:07,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:07:10,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:10,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:11,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:11,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:07:12,050 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:07:12,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21, 21] imperfect sequences [21] total 59 [2019-10-03 03:07:12,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:12,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 03:07:12,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 03:07:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=3163, Unknown=1, NotChecked=0, Total=3422 [2019-10-03 03:07:12,052 INFO L87 Difference]: Start difference. First operand 105123 states and 122541 transitions. Second operand 21 states. [2019-10-03 03:07:12,538 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-10-03 03:07:19,825 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:07:20,620 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-10-03 03:07:23,251 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-10-03 03:07:26,602 WARN L191 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-10-03 03:07:35,165 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-03 03:07:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:43,603 INFO L93 Difference]: Finished difference Result 201271 states and 235829 transitions. [2019-10-03 03:07:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:07:43,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2019-10-03 03:07:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:43,805 INFO L225 Difference]: With dead ends: 201271 [2019-10-03 03:07:43,806 INFO L226 Difference]: Without dead ends: 201271 [2019-10-03 03:07:43,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=562, Invalid=4549, Unknown=1, NotChecked=0, Total=5112 [2019-10-03 03:07:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201271 states. [2019-10-03 03:07:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201271 to 105128. [2019-10-03 03:07:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105128 states. [2019-10-03 03:07:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105128 states to 105128 states and 122546 transitions. [2019-10-03 03:07:45,702 INFO L78 Accepts]: Start accepts. Automaton has 105128 states and 122546 transitions. Word has length 120 [2019-10-03 03:07:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:45,702 INFO L475 AbstractCegarLoop]: Abstraction has 105128 states and 122546 transitions. [2019-10-03 03:07:45,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 03:07:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 105128 states and 122546 transitions. [2019-10-03 03:07:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 03:07:45,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:45,705 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:07:45,705 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:45,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2088228178, now seen corresponding path program 1 times [2019-10-03 03:07:45,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:45,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:46,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:46,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:46,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-10-03 03:07:46,237 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [147], [149], [152], [155], [158], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [451], [456], [557], [558], [562], [563], [564] [2019-10-03 03:07:46,241 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:46,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:46,252 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:46,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:46,373 INFO L272 AbstractInterpreter]: Visited 116 different actions 416 times. Merged at 42 different actions 275 times. Widened at 12 different actions 30 times. Performed 1551 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1551 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 10 different actions. Largest state had 127 variables. [2019-10-03 03:07:46,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:46,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:46,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:46,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:07:46,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:46,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:46,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-03 03:07:46,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:47,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:48,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:49,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:49,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:49,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:49,981 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-10-03 03:07:50,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:07:51,100 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-03 03:07:51,100 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-03 03:07:51,453 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-03 03:07:51,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:51,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:07:51,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:07:52,162 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-03 03:07:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:54,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:07:54,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 21] total 62 [2019-10-03 03:07:54,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:07:54,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-03 03:07:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-03 03:07:54,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3539, Unknown=0, NotChecked=0, Total=3782 [2019-10-03 03:07:54,013 INFO L87 Difference]: Start difference. First operand 105128 states and 122546 transitions. Second operand 44 states. [2019-10-03 03:07:54,667 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-10-03 03:07:57,460 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-03 03:07:58,467 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:08:00,195 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:08:00,623 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:08:01,640 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-03 03:08:02,135 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-10-03 03:08:03,081 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-10-03 03:08:04,024 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:08:04,877 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:08:05,107 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-10-03 03:08:05,670 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:08:06,134 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-03 03:08:06,961 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-03 03:08:07,391 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-03 03:08:08,715 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-03 03:08:09,045 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-03 03:08:09,327 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-03 03:08:09,895 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-10-03 03:08:10,098 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-03 03:08:10,361 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-03 03:08:10,587 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-03 03:08:11,667 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-03 03:08:11,880 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-03 03:08:12,547 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-03 03:08:12,811 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-03 03:08:13,107 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-03 03:08:13,843 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-03 03:08:14,117 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-03 03:08:15,007 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-03 03:08:15,305 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-03 03:08:15,781 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-03 03:08:17,379 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-03 03:08:18,402 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-03 03:08:18,863 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-03 03:08:19,170 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-10-03 03:08:20,083 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-10-03 03:08:20,305 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-03 03:08:20,889 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-10-03 03:08:22,250 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-03 03:08:23,305 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-03 03:08:23,687 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-03 03:08:27,249 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-10-03 03:08:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:30,026 INFO L93 Difference]: Finished difference Result 311165 states and 362731 transitions. [2019-10-03 03:08:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-10-03 03:08:30,026 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 121 [2019-10-03 03:08:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:30,344 INFO L225 Difference]: With dead ends: 311165 [2019-10-03 03:08:30,344 INFO L226 Difference]: Without dead ends: 311165 [2019-10-03 03:08:30,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 188 SyntacticMatches, 15 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9493 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=3870, Invalid=29072, Unknown=0, NotChecked=0, Total=32942 [2019-10-03 03:08:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311165 states. [2019-10-03 03:08:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311165 to 111840. [2019-10-03 03:08:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111840 states. [2019-10-03 03:08:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111840 states to 111840 states and 130244 transitions. [2019-10-03 03:08:32,754 INFO L78 Accepts]: Start accepts. Automaton has 111840 states and 130244 transitions. Word has length 121 [2019-10-03 03:08:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:32,754 INFO L475 AbstractCegarLoop]: Abstraction has 111840 states and 130244 transitions. [2019-10-03 03:08:32,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-03 03:08:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 111840 states and 130244 transitions. [2019-10-03 03:08:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 03:08:32,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:32,757 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:08:32,757 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash 120418170, now seen corresponding path program 1 times [2019-10-03 03:08:32,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:32,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:32,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:34,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:34,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:34,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-10-03 03:08:34,037 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [463], [468], [557], [558], [562], [563], [564] [2019-10-03 03:08:34,039 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:34,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:34,049 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:34,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:08:34,241 INFO L272 AbstractInterpreter]: Visited 116 different actions 516 times. Merged at 42 different actions 369 times. Widened at 14 different actions 49 times. Performed 1899 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1899 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 12 different actions. Largest state had 127 variables. [2019-10-03 03:08:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:34,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:08:34,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:34,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:08:34,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:34,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:08:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:34,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:08:34,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:08:34,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:34,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:34,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:34,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:35,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:08:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:08:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 42 [2019-10-03 03:08:35,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:08:35,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-03 03:08:35,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-03 03:08:35,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 03:08:35,583 INFO L87 Difference]: Start difference. First operand 111840 states and 130244 transitions. Second operand 36 states. [2019-10-03 03:08:35,875 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-10-03 03:08:37,405 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-10-03 03:08:38,105 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-10-03 03:08:38,605 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-10-03 03:08:38,814 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-03 03:08:39,258 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-03 03:08:40,454 WARN L191 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-03 03:08:40,953 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-03 03:08:44,173 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-10-03 03:08:44,577 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-10-03 03:08:45,282 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-10-03 03:08:47,046 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-10-03 03:08:47,302 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:08:49,250 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-03 03:08:49,846 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-10-03 03:08:50,105 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-03 03:08:50,502 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-10-03 03:08:50,895 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-03 03:08:51,045 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-10-03 03:08:51,715 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-10-03 03:08:51,886 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-10-03 03:08:52,060 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-03 03:08:52,529 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-10-03 03:08:53,235 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-10-03 03:08:53,650 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-10-03 03:08:53,824 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-10-03 03:08:54,039 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-03 03:08:54,486 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-10-03 03:08:54,660 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-10-03 03:08:55,134 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-10-03 03:08:57,936 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-10-03 03:08:58,125 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-03 03:08:58,511 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:09:00,930 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-03 03:09:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:01,538 INFO L93 Difference]: Finished difference Result 368760 states and 424783 transitions. [2019-10-03 03:09:01,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-10-03 03:09:01,538 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 121 [2019-10-03 03:09:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:01,929 INFO L225 Difference]: With dead ends: 368760 [2019-10-03 03:09:01,929 INFO L226 Difference]: Without dead ends: 368760 [2019-10-03 03:09:01,930 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 223 SyntacticMatches, 4 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4905 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=2770, Invalid=15590, Unknown=0, NotChecked=0, Total=18360 [2019-10-03 03:09:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368760 states. [2019-10-03 03:09:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368760 to 119780. [2019-10-03 03:09:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119780 states. [2019-10-03 03:09:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119780 states to 119780 states and 139280 transitions. [2019-10-03 03:09:04,649 INFO L78 Accepts]: Start accepts. Automaton has 119780 states and 139280 transitions. Word has length 121 [2019-10-03 03:09:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:04,650 INFO L475 AbstractCegarLoop]: Abstraction has 119780 states and 139280 transitions. [2019-10-03 03:09:04,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-03 03:09:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 119780 states and 139280 transitions. [2019-10-03 03:09:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 03:09:04,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:04,653 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:04,653 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1881452689, now seen corresponding path program 1 times [2019-10-03 03:09:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:04,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:04,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:05,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:05,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 03:09:05,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:05,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:09:05,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:09:05,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:09:05,044 INFO L87 Difference]: Start difference. First operand 119780 states and 139280 transitions. Second operand 18 states. [2019-10-03 03:09:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:09,019 INFO L93 Difference]: Finished difference Result 172939 states and 200809 transitions. [2019-10-03 03:09:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-03 03:09:09,019 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2019-10-03 03:09:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:09,192 INFO L225 Difference]: With dead ends: 172939 [2019-10-03 03:09:09,192 INFO L226 Difference]: Without dead ends: 172939 [2019-10-03 03:09:09,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=351, Invalid=1719, Unknown=0, NotChecked=0, Total=2070 [2019-10-03 03:09:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172939 states. [2019-10-03 03:09:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172939 to 126031. [2019-10-03 03:09:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126031 states. [2019-10-03 03:09:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126031 states to 126031 states and 146590 transitions. [2019-10-03 03:09:10,370 INFO L78 Accepts]: Start accepts. Automaton has 126031 states and 146590 transitions. Word has length 121 [2019-10-03 03:09:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:10,370 INFO L475 AbstractCegarLoop]: Abstraction has 126031 states and 146590 transitions. [2019-10-03 03:09:10,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:09:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 126031 states and 146590 transitions. [2019-10-03 03:09:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 03:09:10,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:10,374 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:10,374 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:10,374 INFO L82 PathProgramCache]: Analyzing trace with hash -178180023, now seen corresponding path program 1 times [2019-10-03 03:09:10,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:10,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:11,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:11,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:11,759 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-10-03 03:09:11,759 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [135], [138], [141], [144], [147], [149], [152], [155], [158], [161], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [206], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [307], [310], [318], [321], [324], [327], [329], [331], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [475], [480], [557], [558], [562], [563], [564] [2019-10-03 03:09:11,761 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:11,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:11,768 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:11,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:09:11,910 INFO L272 AbstractInterpreter]: Visited 116 different actions 546 times. Merged at 42 different actions 397 times. Widened at 15 different actions 64 times. Performed 1931 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1931 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 11 different actions. Largest state had 127 variables. [2019-10-03 03:09:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:11,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:09:11,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:11,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:09:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:12,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:09:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:12,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-03 03:09:12,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:09:12,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:13,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:13,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:13,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:14,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:09:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:15,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:09:15,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 20] total 59 [2019-10-03 03:09:15,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:09:15,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-03 03:09:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-03 03:09:15,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3182, Unknown=0, NotChecked=0, Total=3422 [2019-10-03 03:09:15,865 INFO L87 Difference]: Start difference. First operand 126031 states and 146590 transitions. Second operand 42 states. [2019-10-03 03:09:16,090 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:09:17,424 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-10-03 03:09:17,837 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-03 03:09:18,113 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-03 03:09:18,991 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:09:19,796 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-10-03 03:09:20,551 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-03 03:09:23,490 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:09:24,569 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:09:27,437 WARN L191 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-10-03 03:09:29,151 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-10-03 03:09:29,925 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-03 03:09:30,671 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-10-03 03:09:31,440 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-03 03:09:33,833 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-03 03:09:35,796 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:09:38,331 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 56 [2019-10-03 03:09:40,341 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-03 03:09:40,819 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:09:43,388 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:09:44,691 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-03 03:09:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:46,172 INFO L93 Difference]: Finished difference Result 374633 states and 435780 transitions. [2019-10-03 03:09:46,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-03 03:09:46,172 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-10-03 03:09:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:46,591 INFO L225 Difference]: With dead ends: 374633 [2019-10-03 03:09:46,591 INFO L226 Difference]: Without dead ends: 374633 [2019-10-03 03:09:46,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 197 SyntacticMatches, 9 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4318 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=2093, Invalid=14163, Unknown=0, NotChecked=0, Total=16256 [2019-10-03 03:09:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374633 states. [2019-10-03 03:09:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374633 to 125904. [2019-10-03 03:09:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125904 states. [2019-10-03 03:09:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125904 states to 125904 states and 146446 transitions. [2019-10-03 03:09:49,418 INFO L78 Accepts]: Start accepts. Automaton has 125904 states and 146446 transitions. Word has length 121 [2019-10-03 03:09:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:49,418 INFO L475 AbstractCegarLoop]: Abstraction has 125904 states and 146446 transitions. [2019-10-03 03:09:49,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-03 03:09:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 125904 states and 146446 transitions. [2019-10-03 03:09:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 03:09:49,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:49,421 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:09:49,422 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:49,422 INFO L82 PathProgramCache]: Analyzing trace with hash -114739222, now seen corresponding path program 1 times [2019-10-03 03:09:49,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:49,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:49,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:49,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:50,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:50,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:50,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2019-10-03 03:09:50,578 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [74], [78], [81], [84], [87], [89], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [130], [133], [135], [138], [141], [144], [149], [152], [155], [158], [163], [166], [169], [173], [176], [192], [194], [197], [200], [203], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [257], [259], [261], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [451], [456], [463], [468], [557], [558], [562], [563], [564] [2019-10-03 03:09:50,580 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:50,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:50,590 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:50,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:09:50,739 INFO L272 AbstractInterpreter]: Visited 117 different actions 475 times. Merged at 42 different actions 330 times. Widened at 14 different actions 44 times. Performed 1711 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1711 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 10 different actions. Largest state had 127 variables. [2019-10-03 03:09:50,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:50,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:09:50,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:50,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 03:09:50,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:50,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:09:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:50,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-03 03:09:50,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:09:51,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:51,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:51,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:51,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:51,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:51,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:52,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:52,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:52,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:09:52,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:52,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:53,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:53,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:53,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:53,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:09:53,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 12] total 45 [2019-10-03 03:09:53,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:09:53,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-03 03:09:53,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-03 03:09:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1835, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 03:09:53,133 INFO L87 Difference]: Start difference. First operand 125904 states and 146446 transitions. Second operand 36 states. [2019-10-03 03:09:53,374 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-03 03:09:53,705 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-03 03:09:55,773 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-10-03 03:09:56,290 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-03 03:09:56,992 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-10-03 03:09:57,313 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-03 03:09:58,121 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-03 03:09:58,439 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-10-03 03:09:58,744 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-03 03:09:59,250 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-10-03 03:09:59,446 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-03 03:09:59,905 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-10-03 03:10:02,098 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-10-03 03:10:02,430 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-03 03:10:02,956 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-03 03:10:03,150 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-03 03:10:03,599 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:10:03,888 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-03 03:10:04,431 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:10:04,748 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-03 03:10:05,608 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-10-03 03:10:06,311 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-10-03 03:10:06,588 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-03 03:10:07,109 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:10:07,643 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-10-03 03:10:07,889 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-03 03:10:08,155 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-10-03 03:10:08,596 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-10-03 03:10:09,123 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-03 03:10:09,360 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-03 03:10:09,533 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-03 03:10:11,003 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-10-03 03:10:11,257 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:10:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:12,172 INFO L93 Difference]: Finished difference Result 154053 states and 178377 transitions. [2019-10-03 03:10:12,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-03 03:10:12,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-10-03 03:10:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:12,347 INFO L225 Difference]: With dead ends: 154053 [2019-10-03 03:10:12,347 INFO L226 Difference]: Without dead ends: 154053 [2019-10-03 03:10:12,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 215 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1973 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=1614, Invalid=7506, Unknown=0, NotChecked=0, Total=9120 [2019-10-03 03:10:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154053 states. [2019-10-03 03:10:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154053 to 123709. [2019-10-03 03:10:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123709 states. [2019-10-03 03:10:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123709 states to 123709 states and 143823 transitions. [2019-10-03 03:10:13,523 INFO L78 Accepts]: Start accepts. Automaton has 123709 states and 143823 transitions. Word has length 122 [2019-10-03 03:10:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:13,523 INFO L475 AbstractCegarLoop]: Abstraction has 123709 states and 143823 transitions. [2019-10-03 03:10:13,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-03 03:10:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 123709 states and 143823 transitions. [2019-10-03 03:10:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 03:10:13,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:13,529 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:10:13,530 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash 347849401, now seen corresponding path program 1 times [2019-10-03 03:10:13,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:13,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:13,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 03:10:13,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:13,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:10:13,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:13,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:10:13,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:10:13,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:10:13,598 INFO L87 Difference]: Start difference. First operand 123709 states and 143823 transitions. Second operand 3 states. [2019-10-03 03:10:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:13,745 INFO L93 Difference]: Finished difference Result 53217 states and 60648 transitions. [2019-10-03 03:10:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:10:13,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-03 03:10:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:13,813 INFO L225 Difference]: With dead ends: 53217 [2019-10-03 03:10:13,813 INFO L226 Difference]: Without dead ends: 53217 [2019-10-03 03:10:13,814 INFO L640 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-10-03 03:10:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53217 states. [2019-10-03 03:10:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53217 to 52238. [2019-10-03 03:10:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52238 states. [2019-10-03 03:10:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52238 states to 52238 states and 59481 transitions. [2019-10-03 03:10:14,955 INFO L78 Accepts]: Start accepts. Automaton has 52238 states and 59481 transitions. Word has length 142 [2019-10-03 03:10:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:14,956 INFO L475 AbstractCegarLoop]: Abstraction has 52238 states and 59481 transitions. [2019-10-03 03:10:14,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:10:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52238 states and 59481 transitions. [2019-10-03 03:10:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 03:10:14,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:14,962 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:10:14,962 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2078836324, now seen corresponding path program 1 times [2019-10-03 03:10:14,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:14,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:14,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-03 03:10:15,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:15,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 03:10:15,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:15,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 03:10:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 03:10:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:10:15,402 INFO L87 Difference]: Start difference. First operand 52238 states and 59481 transitions. Second operand 14 states. [2019-10-03 03:10:16,106 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-10-03 03:10:16,253 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-03 03:10:16,444 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-03 03:10:16,610 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-03 03:10:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:18,060 INFO L93 Difference]: Finished difference Result 70720 states and 80108 transitions. [2019-10-03 03:10:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:10:18,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 143 [2019-10-03 03:10:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:18,120 INFO L225 Difference]: With dead ends: 70720 [2019-10-03 03:10:18,120 INFO L226 Difference]: Without dead ends: 70720 [2019-10-03 03:10:18,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:10:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70720 states. [2019-10-03 03:10:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70720 to 54569. [2019-10-03 03:10:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54569 states. [2019-10-03 03:10:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54569 states to 54569 states and 61867 transitions. [2019-10-03 03:10:18,598 INFO L78 Accepts]: Start accepts. Automaton has 54569 states and 61867 transitions. Word has length 143 [2019-10-03 03:10:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:18,598 INFO L475 AbstractCegarLoop]: Abstraction has 54569 states and 61867 transitions. [2019-10-03 03:10:18,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 03:10:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 54569 states and 61867 transitions. [2019-10-03 03:10:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 03:10:18,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:18,602 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 03:10:18,602 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1379140528, now seen corresponding path program 1 times [2019-10-03 03:10:18,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:18,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:18,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:18,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:18,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:10:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:10:18,778 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 03:10:18,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:10:18 BoogieIcfgContainer [2019-10-03 03:10:18,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:10:18,968 INFO L168 Benchmark]: Toolchain (without parser) took 572142.35 ms. Allocated memory was 140.0 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 87.0 MB in the beginning and 984.7 MB in the end (delta: -897.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-10-03 03:10:18,968 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-03 03:10:18,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.28 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 86.8 MB in the beginning and 169.9 MB in the end (delta: -83.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:18,969 INFO L168 Benchmark]: Boogie Preprocessor took 58.15 ms. Allocated memory is still 199.8 MB. Free memory was 169.9 MB in the beginning and 167.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:18,969 INFO L168 Benchmark]: RCFGBuilder took 854.14 ms. Allocated memory is still 199.8 MB. Free memory was 167.1 MB in the beginning and 109.0 MB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:18,969 INFO L168 Benchmark]: TraceAbstraction took 570636.20 ms. Allocated memory was 199.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 109.0 MB in the beginning and 984.7 MB in the end (delta: -875.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-10-03 03:10:18,970 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 589.28 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 86.8 MB in the beginning and 169.9 MB in the end (delta: -83.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.15 ms. Allocated memory is still 199.8 MB. Free memory was 169.9 MB in the beginning and 167.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.14 ms. Allocated memory is still 199.8 MB. Free memory was 167.1 MB in the beginning and 109.0 MB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 570636.20 ms. Allocated memory was 199.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 109.0 MB in the beginning and 984.7 MB in the end (delta: -875.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 383]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] char r1 = '\x0'; [L13] port_t p1 = 0; [L14] char p1_old = '\x0'; [L15] char p1_new = '\x0'; [L16] char id1 = '\x0'; [L17] char st1 = '\x0'; [L18] msg_t send1 = '\x0'; [L19] _Bool mode1 = 0; [L20] _Bool alive1 = 0; [L21] port_t p2 = 0; [L22] char p2_old = '\x0'; [L23] char p2_new = '\x0'; [L24] char id2 = '\x0'; [L25] char st2 = '\x0'; [L26] msg_t send2 = '\x0'; [L27] _Bool mode2 = 0; [L28] _Bool alive2 = 0; [L29] port_t p3 = 0; [L30] char p3_old = '\x0'; [L31] char p3_new = '\x0'; [L32] char id3 = '\x0'; [L33] char st3 = '\x0'; [L34] msg_t send3 = '\x0'; [L35] _Bool mode3 = 0; [L36] _Bool alive3 = 0; [L40] void (*nodes[3])() = { &node1, &node2, &node3 }; [L44] int __return_6067; [L45] int __return_6144; [L46] int __return_6207; [L47] int __tmp_6234_0; [L48] int __return_6276; [L49] int __tmp_6277_0; [L50] int __return_6290; [L51] int __return_6445; VAL [\old(__return_6067)=283, \old(__return_6144)=260, \old(__return_6207)=269, \old(__return_6276)=259, \old(__return_6290)=271, \old(__return_6445)=270, \old(__return_main)=285, \old(__tmp_6234_0)=263, \old(__tmp_6277_0)=258, \old(alive1)=16, \old(alive2)=30, \old(alive3)=31, \old(id1)=262, \old(id2)=290, \old(id3)=280, \old(mode1)=25, \old(mode2)=32, \old(mode3)=19, \old(nomsg)=268, \old(p1)=292, \old(p1_new)=276, \old(p1_old)=291, \old(p2)=264, \old(p2_new)=274, \old(p2_old)=279, \old(p3)=267, \old(p3_new)=282, \old(p3_old)=278, \old(r1)=273, \old(send1)=284, \old(send2)=265, \old(send3)=261, \old(st1)=266, \old(st2)=289, \old(st3)=277, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L54] int main__c1; [L55] int main__i2; [L56] main__c1 = 0 [L57] r1 = __VERIFIER_nondet_char() [L58] id1 = __VERIFIER_nondet_char() [L59] st1 = __VERIFIER_nondet_char() [L60] send1 = __VERIFIER_nondet_char() [L61] mode1 = __VERIFIER_nondet_bool() [L62] alive1 = __VERIFIER_nondet_bool() [L63] id2 = __VERIFIER_nondet_char() [L64] st2 = __VERIFIER_nondet_char() [L65] send2 = __VERIFIER_nondet_char() [L66] mode2 = __VERIFIER_nondet_bool() [L67] alive2 = __VERIFIER_nondet_bool() [L68] id3 = __VERIFIER_nondet_char() [L69] st3 = __VERIFIER_nondet_char() [L70] send3 = __VERIFIER_nondet_char() [L71] mode3 = __VERIFIER_nondet_bool() [L72] alive3 = __VERIFIER_nondet_bool() [L74] int init__tmp; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L75] COND TRUE ((int)r1) == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L77] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L79] COND TRUE ((int)id1) >= 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L81] COND TRUE ((int)st1) == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L83] COND TRUE ((int)send1) == ((int)id1) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L85] COND TRUE ((int)mode1) == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L87] COND TRUE ((int)id2) >= 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L89] COND TRUE ((int)st2) == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L91] COND TRUE ((int)send2) == ((int)id2) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L93] COND TRUE ((int)mode2) == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L95] COND TRUE ((int)id3) >= 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L97] COND TRUE ((int)st3) == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L99] COND TRUE ((int)send3) == ((int)id3) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L101] COND TRUE ((int)mode3) == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L103] COND TRUE ((int)id1) != ((int)id2) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L105] COND TRUE ((int)id1) != ((int)id3) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=0, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, main__c1=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=4, send3=127, st1=0, st2=0, st3=0] [L107] COND TRUE ((int)id2) != ((int)id3) [L109] init__tmp = 1 [L110] __return_6067 = init__tmp [L111] main__i2 = __return_6067 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=1, 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=4, send3=127, st1=0, st2=0, st3=0] [L112] COND TRUE main__i2 != 0 [L114] p1_old = nomsg [L115] p1_new = nomsg [L116] p2_old = nomsg [L117] p2_new = nomsg [L118] p3_old = nomsg [L119] p3_new = nomsg [L120] main__i2 = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L121] COND TRUE main__i2 < 6 [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L126] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L132] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L143] mode1 = 1 [L145] msg_t node2__m2; [L146] node2__m2 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L147] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L153] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L920] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L164] mode2 = 1 [L166] msg_t node3__m3; [L167] node3__m3 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L174] COND TRUE !(alive3 == 0) [L176] int node3____CPAchecker_TMP_0; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L177] COND TRUE send3 != nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L179] COND TRUE p3_new == nomsg [L181] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L183] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L185] mode3 = 1 [L186] p1_old = p1_new [L187] p1_new = nomsg [L188] p2_old = p2_new [L189] p2_new = nomsg [L190] p3_old = p3_new [L191] p3_new = nomsg [L193] int check__tmp; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L194] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=0, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)r1) < 3 [L198] check__tmp = 1 [L199] __return_6144 = check__tmp [L200] main__c1 = __return_6144 [L202] _Bool __tmp_1; [L203] __tmp_1 = main__c1 [L204] _Bool assert__arg; [L205] assert__arg = __tmp_1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L206] COND FALSE !(assert__arg == 0) [L212] int main____CPAchecker_TMP_0 = main__i2; [L213] main__i2 = main__i2 + 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE main__i2 < 6 [L217] msg_t node1__m1; [L218] node1__m1 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L219] COND TRUE !(mode1 == 0) [L221] r1 = (char)(((int)r1) + 1) [L222] node1__m1 = p3_old [L223] p3_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L224] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=127, st1=0, st2=0, st3=0] [L226] COND FALSE !(!(alive1 == 0)) [L830] send1 = node1__m1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L233] mode1 = 0 [L235] msg_t node2__m2; [L236] node2__m2 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L237] COND TRUE !(mode2 == 0) [L239] node2__m2 = p1_old [L240] p1_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L241] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L250] mode2 = 0 [L252] msg_t node3__m3; [L253] node3__m3 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L254] COND TRUE !(mode3 == 0) [L256] node3__m3 = p2_old [L257] p2_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L258] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L267] mode3 = 0 [L268] p1_old = p1_new [L269] p1_new = nomsg [L270] p2_old = p2_new [L271] p2_new = nomsg [L272] p3_old = p3_new [L273] p3_new = nomsg [L275] int check__tmp; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L276] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=0, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L278] COND TRUE ((int)r1) < 3 [L280] check__tmp = 1 [L281] __return_6207 = check__tmp [L282] main__c1 = __return_6207 [L284] _Bool __tmp_2; [L285] __tmp_2 = main__c1 [L286] _Bool assert__arg; [L287] assert__arg = __tmp_2 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L288] COND FALSE !(assert__arg == 0) [L294] int main____CPAchecker_TMP_0 = main__i2; [L295] main__i2 = main__i2 + 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L296] COND TRUE main__i2 < 6 [L299] msg_t node1__m1; [L300] node1__m1 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L301] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L700] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L711] mode1 = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=0, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L317] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L319] main____CPAchecker_TMP_0 = __tmp_6234_0 [L321] msg_t node2__m2; [L322] node2__m2 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L323] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L614] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L642] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L625] mode2 = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L339] msg_t node3__m3; [L340] node3__m3 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L341] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L528] COND TRUE !(alive3 == 0) [L530] int node3____CPAchecker_TMP_0; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L531] COND TRUE send3 != nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L533] COND TRUE p3_new == nomsg [L535] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L537] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L539] mode3 = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L356] p1_old = p1_new [L357] p1_new = nomsg [L358] p2_old = p2_new [L359] p2_new = nomsg [L360] p3_old = p3_new [L361] p3_new = nomsg [L363] int check__tmp; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L364] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L366] COND TRUE ((int)r1) < 3 [L368] check__tmp = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L371] __return_6276 = check__tmp [L372] main__c1 = __return_6276 [L373] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L375] main____CPAchecker_TMP_0 = __tmp_6277_0 [L377] _Bool __tmp_3; [L378] __tmp_3 = main__c1 [L379] _Bool assert__arg; [L380] assert__arg = __tmp_3 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L381] COND FALSE !(assert__arg == 0) [L388] int main____CPAchecker_TMP_0 = main__i2; [L389] main__i2 = main__i2 + 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L390] COND TRUE main__i2 < 6 [L393] msg_t node1__m1; [L394] node1__m1 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L395] COND TRUE !(mode1 == 0) [L397] r1 = (char)(((int)r1) + 1) [L398] node1__m1 = p3_old [L399] p3_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L400] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L402] COND FALSE !(!(alive1 == 0)) [L429] send1 = node1__m1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L409] mode1 = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=1, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L411] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L319] main____CPAchecker_TMP_0 = __tmp_6234_0 [L321] msg_t node2__m2; [L322] node2__m2 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L323] COND TRUE !(mode2 == 0) [L325] node2__m2 = p1_old [L326] p1_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L327] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L336] mode2 = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L339] msg_t node3__m3; [L340] node3__m3 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L341] COND TRUE !(mode3 == 0) [L343] node3__m3 = p2_old [L344] p2_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=127, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L345] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L354] mode3 = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L356] p1_old = p1_new [L357] p1_new = nomsg [L358] p2_old = p2_new [L359] p2_new = nomsg [L360] p3_old = p3_new [L361] p3_new = nomsg [L363] int check__tmp; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L364] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L366] COND TRUE ((int)r1) < 3 [L368] check__tmp = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L371] __return_6276 = check__tmp [L372] main__c1 = __return_6276 [L373] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L375] main____CPAchecker_TMP_0 = __tmp_6277_0 [L377] _Bool __tmp_3; [L378] __tmp_3 = main__c1 [L379] _Bool assert__arg; [L380] assert__arg = __tmp_3 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L381] COND FALSE !(assert__arg == 0) [L388] int main____CPAchecker_TMP_0 = main__i2; [L389] main__i2 = main__i2 + 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L390] COND TRUE main__i2 < 6 [L393] msg_t node1__m1; [L394] node1__m1 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L395] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L440] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L451] mode1 = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=2, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L411] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L319] main____CPAchecker_TMP_0 = __tmp_6234_0 [L321] msg_t node2__m2; [L322] node2__m2 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L323] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L614] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L642] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L625] mode2 = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L339] msg_t node3__m3; [L340] node3__m3 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L341] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L528] COND TRUE !(alive3 == 0) [L530] int node3____CPAchecker_TMP_0; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L531] COND TRUE send3 != nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L533] COND TRUE p3_new == nomsg [L535] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L537] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L539] mode3 = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L356] p1_old = p1_new [L357] p1_new = nomsg [L358] p2_old = p2_new [L359] p2_new = nomsg [L360] p3_old = p3_new [L361] p3_new = nomsg [L363] int check__tmp; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L364] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L366] COND TRUE ((int)r1) < 3 [L368] check__tmp = 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=2, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L371] __return_6276 = check__tmp [L372] main__c1 = __return_6276 [L373] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L375] main____CPAchecker_TMP_0 = __tmp_6277_0 [L377] _Bool __tmp_3; [L378] __tmp_3 = main__c1 [L379] _Bool assert__arg; [L380] assert__arg = __tmp_3 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L381] COND FALSE !(assert__arg == 0) [L388] int main____CPAchecker_TMP_0 = main__i2; [L389] main__i2 = main__i2 + 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L390] COND TRUE main__i2 < 6 [L393] msg_t node1__m1; [L394] node1__m1 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L395] COND TRUE !(mode1 == 0) [L397] r1 = (char)(((int)r1) + 1) [L398] node1__m1 = p3_old [L399] p3_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L400] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L402] COND FALSE !(!(alive1 == 0)) [L429] send1 = node1__m1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L409] mode1 = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=3, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L411] __tmp_6234_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L319] main____CPAchecker_TMP_0 = __tmp_6234_0 [L321] msg_t node2__m2; [L322] node2__m2 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L323] COND TRUE !(mode2 == 0) [L325] node2__m2 = p1_old [L326] p1_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=127, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L327] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L336] mode2 = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L339] msg_t node3__m3; [L340] node3__m3 = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L341] COND TRUE !(mode3 == 0) [L343] node3__m3 = p2_old [L344] p2_old = nomsg VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L345] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L354] mode3 = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L356] p1_old = p1_new [L357] p1_new = nomsg [L358] p2_old = p2_new [L359] p2_new = nomsg [L360] p3_old = p3_new [L361] p3_new = nomsg [L363] int check__tmp; VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L364] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L366] COND FALSE !(((int)r1) < 3) VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L483] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L490] check__tmp = 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=1, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=3, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L371] __return_6276 = check__tmp [L372] main__c1 = __return_6276 [L373] __tmp_6277_0 = main____CPAchecker_TMP_0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L375] main____CPAchecker_TMP_0 = __tmp_6277_0 [L377] _Bool __tmp_3; [L378] __tmp_3 = main__c1 [L379] _Bool assert__arg; [L380] assert__arg = __tmp_3 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L381] COND TRUE assert__arg == 0 VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] [L383] __VERIFIER_error() VAL [\old(__return_6067)=0, \old(__return_6144)=0, \old(__return_6207)=0, \old(__return_6276)=0, \old(__return_6290)=0, \old(__return_6445)=0, \old(__tmp_6234_0)=0, \old(__tmp_6277_0)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_6067=1, __return_6144=1, __return_6207=1, __return_6276=0, __return_6290=0, __return_6445=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, __tmp_6234_0=4, __tmp_6277_0=4, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=0, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=0, id1=0, id2=4, id3=127, init__tmp=1, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=0, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=4, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 153 locations, 1 error locations. UNSAFE Result, 570.5s OverallTime, 64 OverallIterations, 4 TraceHistogramMax, 431.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19387 SDtfs, 89409 SDslu, 162995 SDs, 0 SdLazy, 86873 SolverSat, 3772 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 141.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5490 GetRequests, 3164 SyntacticMatches, 144 SemanticMatches, 2182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61240 ImplicationChecksByTransitivity, 265.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157171occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.8s AbstIntTime, 16 AbstIntIterations, 1 AbstIntStrong, 0.9861199334287969 AbsIntWeakeningRatio, 1.4351851851851851 AbsIntAvgWeakeningVarsNumRemoved, 36.05555555555556 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 67.6s AutomataMinimizationTime, 63 MinimizatonAttempts, 2985009 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 50.1s InterpolantComputationTime, 7419 NumberOfCodeBlocks, 7419 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 8915 ConstructedInterpolants, 594 QuantifiedInterpolants, 12795426 SizeOfPredicates, 132 NumberOfNonLiveVariables, 11170 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 93 InterpolantComputations, 57 PerfectInterpolantSequences, 575/684 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...