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-112bae1 [2019-09-10 06:37:47,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:37:47,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:37:47,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:37:47,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:37:47,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:37:47,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:37:47,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:37:47,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:37:47,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:37:47,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:37:47,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:37:47,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:37:47,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:37:47,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:37:47,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:37:47,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:37:47,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:37:47,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:37:47,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:37:47,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:37:47,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:37:47,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:37:47,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:37:47,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:37:47,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:37:47,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:37:47,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:37:47,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:37:47,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:37:47,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:37:47,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:37:47,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:37:47,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:37:47,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:37:47,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:37:47,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:37:47,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:37:47,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:37:47,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:37:47,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:37:47,450 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-09-10 06:37:47,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:37:47,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:37:47,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:37:47,465 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:37:47,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:37:47,466 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:37:47,466 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:37:47,467 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:37:47,467 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:37:47,467 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:37:47,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:37:47,468 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:37:47,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:37:47,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:37:47,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:37:47,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:37:47,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:37:47,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:37:47,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:37:47,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:37:47,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:37:47,470 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:37:47,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:37:47,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:37:47,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:37:47,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:37:47,471 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:37:47,471 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:37:47,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:37:47,471 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:37:47,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:37:47,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:37:47,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:37:47,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:37:47,517 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:37:47,518 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-09-10 06:37:47,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c525439/b12a4c51d6a149aa90b7594339dd9810/FLAGcaf8675af [2019-09-10 06:37:48,114 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:37:48,115 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-09-10 06:37:48,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c525439/b12a4c51d6a149aa90b7594339dd9810/FLAGcaf8675af [2019-09-10 06:37:48,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c525439/b12a4c51d6a149aa90b7594339dd9810 [2019-09-10 06:37:48,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:37:48,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:37:48,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:37:48,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:37:48,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:37:48,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:37:48" (1/1) ... [2019-09-10 06:37:48,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75378872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:48, skipping insertion in model container [2019-09-10 06:37:48,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:37:48" (1/1) ... [2019-09-10 06:37:48,462 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:37:48,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:37:48,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:37:48,982 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:37:49,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:37:49,130 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:37:49,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49 WrapperNode [2019-09-10 06:37:49,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:37:49,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:37:49,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:37:49,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:37:49,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (1/1) ... [2019-09-10 06:37:49,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (1/1) ... [2019-09-10 06:37:49,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (1/1) ... [2019-09-10 06:37:49,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (1/1) ... [2019-09-10 06:37:49,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (1/1) ... [2019-09-10 06:37:49,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (1/1) ... [2019-09-10 06:37:49,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (1/1) ... [2019-09-10 06:37:49,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:37:49,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:37:49,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:37:49,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:37:49,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (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-09-10 06:37:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:37:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:37:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:37:49,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:37:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:37:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:37:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:37:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:37:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:37:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:37:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:37:49,286 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:37:49,286 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:37:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:37:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:37:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:37:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:37:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:37:50,144 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:37:50,144 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:37:50,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:37:50 BoogieIcfgContainer [2019-09-10 06:37:50,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:37:50,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:37:50,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:37:50,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:37:50,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:37:48" (1/3) ... [2019-09-10 06:37:50,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c04ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:37:50, skipping insertion in model container [2019-09-10 06:37:50,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:37:49" (2/3) ... [2019-09-10 06:37:50,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371c04ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:37:50, skipping insertion in model container [2019-09-10 06:37:50,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:37:50" (3/3) ... [2019-09-10 06:37:50,154 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 06:37:50,163 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:37:50,171 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:37:50,188 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:37:50,209 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:37:50,209 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:37:50,210 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:37:50,210 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:37:50,210 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:37:50,210 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:37:50,210 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:37:50,210 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:37:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-09-10 06:37:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:37:50,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:50,244 INFO L399 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-09-10 06:37:50,247 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:50,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:50,252 INFO L82 PathProgramCache]: Analyzing trace with hash 273290580, now seen corresponding path program 1 times [2019-09-10 06:37:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:50,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:50,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:50,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:50,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:50,805 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 6 states. [2019-09-10 06:37:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:51,248 INFO L93 Difference]: Finished difference Result 668 states and 1034 transitions. [2019-09-10 06:37:51,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:37:51,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-09-10 06:37:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:51,279 INFO L225 Difference]: With dead ends: 668 [2019-09-10 06:37:51,279 INFO L226 Difference]: Without dead ends: 632 [2019-09-10 06:37:51,283 INFO L628 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-09-10 06:37:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-10 06:37:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 425. [2019-09-10 06:37:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-10 06:37:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2019-09-10 06:37:51,359 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 53 [2019-09-10 06:37:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:51,360 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2019-09-10 06:37:51,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2019-09-10 06:37:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:37:51,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:51,363 INFO L399 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-09-10 06:37:51,363 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1842914518, now seen corresponding path program 1 times [2019-09-10 06:37:51,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:51,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:51,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:51,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:51,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:51,523 INFO L87 Difference]: Start difference. First operand 425 states and 641 transitions. Second operand 3 states. [2019-09-10 06:37:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:51,557 INFO L93 Difference]: Finished difference Result 751 states and 1126 transitions. [2019-09-10 06:37:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:51,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:37:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:51,562 INFO L225 Difference]: With dead ends: 751 [2019-09-10 06:37:51,562 INFO L226 Difference]: Without dead ends: 751 [2019-09-10 06:37:51,563 INFO L628 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-09-10 06:37:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-10 06:37:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2019-09-10 06:37:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-09-10 06:37:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1125 transitions. [2019-09-10 06:37:51,597 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1125 transitions. Word has length 56 [2019-09-10 06:37:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:51,598 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1125 transitions. [2019-09-10 06:37:51,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1125 transitions. [2019-09-10 06:37:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:37:51,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:51,601 INFO L399 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-09-10 06:37:51,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -315457832, now seen corresponding path program 1 times [2019-09-10 06:37:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:51,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:51,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:51,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-09-10 06:37:51,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:51,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:51,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:51,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:51,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:51,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:51,719 INFO L87 Difference]: Start difference. First operand 749 states and 1125 transitions. Second operand 3 states. [2019-09-10 06:37:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:51,762 INFO L93 Difference]: Finished difference Result 1339 states and 1975 transitions. [2019-09-10 06:37:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:51,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:37:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:51,771 INFO L225 Difference]: With dead ends: 1339 [2019-09-10 06:37:51,771 INFO L226 Difference]: Without dead ends: 1339 [2019-09-10 06:37:51,772 INFO L628 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-09-10 06:37:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-10 06:37:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-10 06:37:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-10 06:37:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1974 transitions. [2019-09-10 06:37:51,814 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1974 transitions. Word has length 56 [2019-09-10 06:37:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:51,815 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1974 transitions. [2019-09-10 06:37:51,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1974 transitions. [2019-09-10 06:37:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:37:51,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:51,820 INFO L399 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-09-10 06:37:51,820 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash -622080838, now seen corresponding path program 1 times [2019-09-10 06:37:51,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:51,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:51,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:51,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:51,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:51,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:51,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:51,993 INFO L87 Difference]: Start difference. First operand 1337 states and 1974 transitions. Second operand 6 states. [2019-09-10 06:37:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:52,324 INFO L93 Difference]: Finished difference Result 2921 states and 4306 transitions. [2019-09-10 06:37:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:52,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:37:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:52,340 INFO L225 Difference]: With dead ends: 2921 [2019-09-10 06:37:52,340 INFO L226 Difference]: Without dead ends: 2921 [2019-09-10 06:37:52,340 INFO L628 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-09-10 06:37:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2019-09-10 06:37:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2897. [2019-09-10 06:37:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2897 states. [2019-09-10 06:37:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4284 transitions. [2019-09-10 06:37:52,416 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4284 transitions. Word has length 57 [2019-09-10 06:37:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:52,416 INFO L475 AbstractCegarLoop]: Abstraction has 2897 states and 4284 transitions. [2019-09-10 06:37:52,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4284 transitions. [2019-09-10 06:37:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:37:52,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:52,419 INFO L399 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-09-10 06:37:52,420 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -993204644, now seen corresponding path program 1 times [2019-09-10 06:37:52,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:52,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:52,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:52,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:52,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:52,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:52,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:52,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:52,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:52,571 INFO L87 Difference]: Start difference. First operand 2897 states and 4284 transitions. Second operand 5 states. [2019-09-10 06:37:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:52,851 INFO L93 Difference]: Finished difference Result 4135 states and 6037 transitions. [2019-09-10 06:37:52,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:52,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-10 06:37:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:52,873 INFO L225 Difference]: With dead ends: 4135 [2019-09-10 06:37:52,873 INFO L226 Difference]: Without dead ends: 4135 [2019-09-10 06:37:52,874 INFO L628 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-09-10 06:37:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2019-09-10 06:37:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 2897. [2019-09-10 06:37:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2897 states. [2019-09-10 06:37:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4246 transitions. [2019-09-10 06:37:53,021 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4246 transitions. Word has length 58 [2019-09-10 06:37:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:53,021 INFO L475 AbstractCegarLoop]: Abstraction has 2897 states and 4246 transitions. [2019-09-10 06:37:53,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4246 transitions. [2019-09-10 06:37:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:37:53,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:53,060 INFO L399 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-09-10 06:37:53,060 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1499714113, now seen corresponding path program 1 times [2019-09-10 06:37:53,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:53,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:53,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:53,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:53,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:53,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:53,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:37:53,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:53,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:37:53,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:37:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:37:53,180 INFO L87 Difference]: Start difference. First operand 2897 states and 4246 transitions. Second operand 7 states. [2019-09-10 06:37:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:53,898 INFO L93 Difference]: Finished difference Result 12059 states and 17939 transitions. [2019-09-10 06:37:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:37:53,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:37:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:53,956 INFO L225 Difference]: With dead ends: 12059 [2019-09-10 06:37:53,956 INFO L226 Difference]: Without dead ends: 12059 [2019-09-10 06:37:53,957 INFO L628 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-09-10 06:37:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12059 states. [2019-09-10 06:37:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12059 to 2903. [2019-09-10 06:37:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2903 states. [2019-09-10 06:37:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4254 transitions. [2019-09-10 06:37:54,246 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4254 transitions. Word has length 58 [2019-09-10 06:37:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:54,246 INFO L475 AbstractCegarLoop]: Abstraction has 2903 states and 4254 transitions. [2019-09-10 06:37:54,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:37:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4254 transitions. [2019-09-10 06:37:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:37:54,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:54,249 INFO L399 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-09-10 06:37:54,249 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1924616750, now seen corresponding path program 1 times [2019-09-10 06:37:54,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:54,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:54,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:54,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:54,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:37:54,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:54,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:37:54,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:37:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:37:54,381 INFO L87 Difference]: Start difference. First operand 2903 states and 4254 transitions. Second operand 7 states. [2019-09-10 06:37:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:54,863 INFO L93 Difference]: Finished difference Result 10269 states and 14943 transitions. [2019-09-10 06:37:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:37:54,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-10 06:37:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:54,899 INFO L225 Difference]: With dead ends: 10269 [2019-09-10 06:37:54,900 INFO L226 Difference]: Without dead ends: 10269 [2019-09-10 06:37:54,900 INFO L628 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-09-10 06:37:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10269 states. [2019-09-10 06:37:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10269 to 2923. [2019-09-10 06:37:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-09-10 06:37:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4278 transitions. [2019-09-10 06:37:55,030 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4278 transitions. Word has length 59 [2019-09-10 06:37:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:55,030 INFO L475 AbstractCegarLoop]: Abstraction has 2923 states and 4278 transitions. [2019-09-10 06:37:55,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:37:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4278 transitions. [2019-09-10 06:37:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:37:55,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:55,032 INFO L399 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-09-10 06:37:55,032 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash -976844717, now seen corresponding path program 1 times [2019-09-10 06:37:55,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:55,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:55,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:55,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:55,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:55,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:55,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:55,137 INFO L87 Difference]: Start difference. First operand 2923 states and 4278 transitions. Second operand 6 states. [2019-09-10 06:37:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:55,417 INFO L93 Difference]: Finished difference Result 7659 states and 11086 transitions. [2019-09-10 06:37:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:55,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-10 06:37:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:55,434 INFO L225 Difference]: With dead ends: 7659 [2019-09-10 06:37:55,435 INFO L226 Difference]: Without dead ends: 7659 [2019-09-10 06:37:55,435 INFO L628 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-09-10 06:37:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2019-09-10 06:37:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 7655. [2019-09-10 06:37:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-09-10 06:37:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11084 transitions. [2019-09-10 06:37:55,575 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11084 transitions. Word has length 60 [2019-09-10 06:37:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:55,575 INFO L475 AbstractCegarLoop]: Abstraction has 7655 states and 11084 transitions. [2019-09-10 06:37:55,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11084 transitions. [2019-09-10 06:37:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:37:55,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:55,578 INFO L399 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-09-10 06:37:55,578 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:55,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1286220475, now seen corresponding path program 1 times [2019-09-10 06:37:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:55,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:55,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:55,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:55,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:55,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:55,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:55,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:55,674 INFO L87 Difference]: Start difference. First operand 7655 states and 11084 transitions. Second operand 5 states. [2019-09-10 06:37:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:55,808 INFO L93 Difference]: Finished difference Result 15928 states and 23181 transitions. [2019-09-10 06:37:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:55,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 06:37:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:55,845 INFO L225 Difference]: With dead ends: 15928 [2019-09-10 06:37:55,845 INFO L226 Difference]: Without dead ends: 15928 [2019-09-10 06:37:55,846 INFO L628 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-09-10 06:37:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15928 states. [2019-09-10 06:37:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15928 to 9395. [2019-09-10 06:37:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9395 states. [2019-09-10 06:37:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9395 states to 9395 states and 13659 transitions. [2019-09-10 06:37:56,198 INFO L78 Accepts]: Start accepts. Automaton has 9395 states and 13659 transitions. Word has length 61 [2019-09-10 06:37:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:56,198 INFO L475 AbstractCegarLoop]: Abstraction has 9395 states and 13659 transitions. [2019-09-10 06:37:56,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 9395 states and 13659 transitions. [2019-09-10 06:37:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:37:56,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:56,205 INFO L399 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-09-10 06:37:56,206 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 740645981, now seen corresponding path program 1 times [2019-09-10 06:37:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:56,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:56,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:56,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:56,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:56,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:56,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:56,305 INFO L87 Difference]: Start difference. First operand 9395 states and 13659 transitions. Second operand 5 states. [2019-09-10 06:37:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:56,438 INFO L93 Difference]: Finished difference Result 17415 states and 25353 transitions. [2019-09-10 06:37:56,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:56,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 06:37:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:56,483 INFO L225 Difference]: With dead ends: 17415 [2019-09-10 06:37:56,484 INFO L226 Difference]: Without dead ends: 17415 [2019-09-10 06:37:56,487 INFO L628 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-09-10 06:37:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2019-09-10 06:37:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 11338. [2019-09-10 06:37:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-09-10 06:37:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 16529 transitions. [2019-09-10 06:37:56,713 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 16529 transitions. Word has length 61 [2019-09-10 06:37:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:56,713 INFO L475 AbstractCegarLoop]: Abstraction has 11338 states and 16529 transitions. [2019-09-10 06:37:56,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 16529 transitions. [2019-09-10 06:37:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:37:56,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:56,719 INFO L399 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-09-10 06:37:56,719 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1147863087, now seen corresponding path program 1 times [2019-09-10 06:37:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:56,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:56,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:56,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:56,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:56,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:56,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:56,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:56,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:56,775 INFO L87 Difference]: Start difference. First operand 11338 states and 16529 transitions. Second operand 3 states. [2019-09-10 06:37:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:56,855 INFO L93 Difference]: Finished difference Result 16793 states and 23919 transitions. [2019-09-10 06:37:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:56,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 06:37:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:56,914 INFO L225 Difference]: With dead ends: 16793 [2019-09-10 06:37:56,915 INFO L226 Difference]: Without dead ends: 16793 [2019-09-10 06:37:56,916 INFO L628 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-09-10 06:37:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-09-10 06:37:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 13747. [2019-09-10 06:37:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13747 states. [2019-09-10 06:37:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13747 states to 13747 states and 19699 transitions. [2019-09-10 06:37:57,332 INFO L78 Accepts]: Start accepts. Automaton has 13747 states and 19699 transitions. Word has length 64 [2019-09-10 06:37:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:57,332 INFO L475 AbstractCegarLoop]: Abstraction has 13747 states and 19699 transitions. [2019-09-10 06:37:57,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 13747 states and 19699 transitions. [2019-09-10 06:37:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:37:57,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:57,336 INFO L399 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-09-10 06:37:57,337 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2093601519, now seen corresponding path program 1 times [2019-09-10 06:37:57,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:57,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:57,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:57,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:57,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:57,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:37:57,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:57,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:37:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:37:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:37:57,442 INFO L87 Difference]: Start difference. First operand 13747 states and 19699 transitions. Second operand 7 states. [2019-09-10 06:37:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:58,111 INFO L93 Difference]: Finished difference Result 56579 states and 80469 transitions. [2019-09-10 06:37:58,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:37:58,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-10 06:37:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:58,247 INFO L225 Difference]: With dead ends: 56579 [2019-09-10 06:37:58,247 INFO L226 Difference]: Without dead ends: 56579 [2019-09-10 06:37:58,248 INFO L628 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-09-10 06:37:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56579 states. [2019-09-10 06:37:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56579 to 13825. [2019-09-10 06:37:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-09-10 06:37:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19799 transitions. [2019-09-10 06:37:59,398 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19799 transitions. Word has length 64 [2019-09-10 06:37:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:59,398 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 19799 transitions. [2019-09-10 06:37:59,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:37:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19799 transitions. [2019-09-10 06:37:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:37:59,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:59,406 INFO L399 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-09-10 06:37:59,407 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1818867674, now seen corresponding path program 1 times [2019-09-10 06:37:59,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:59,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:59,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:59,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:37:59,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:59,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:37:59,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:37:59,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:37:59,670 INFO L87 Difference]: Start difference. First operand 13825 states and 19799 transitions. Second operand 10 states. [2019-09-10 06:38:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:02,058 INFO L93 Difference]: Finished difference Result 60089 states and 85624 transitions. [2019-09-10 06:38:02,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:38:02,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:38:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:02,139 INFO L225 Difference]: With dead ends: 60089 [2019-09-10 06:38:02,139 INFO L226 Difference]: Without dead ends: 60089 [2019-09-10 06:38:02,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:38:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60089 states. [2019-09-10 06:38:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60089 to 13825. [2019-09-10 06:38:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-09-10 06:38:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19793 transitions. [2019-09-10 06:38:02,642 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19793 transitions. Word has length 66 [2019-09-10 06:38:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:02,642 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 19793 transitions. [2019-09-10 06:38:02,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19793 transitions. [2019-09-10 06:38:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:38:02,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:02,649 INFO L399 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-09-10 06:38:02,649 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1934158108, now seen corresponding path program 1 times [2019-09-10 06:38:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:02,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:02,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:02,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:38:02,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:02,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:38:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:38:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:38:02,830 INFO L87 Difference]: Start difference. First operand 13825 states and 19793 transitions. Second operand 10 states. [2019-09-10 06:38:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:04,442 INFO L93 Difference]: Finished difference Result 37943 states and 53872 transitions. [2019-09-10 06:38:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:38:04,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:38:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:04,483 INFO L225 Difference]: With dead ends: 37943 [2019-09-10 06:38:04,484 INFO L226 Difference]: Without dead ends: 37943 [2019-09-10 06:38:04,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:38:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37943 states. [2019-09-10 06:38:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37943 to 13608. [2019-09-10 06:38:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13608 states. [2019-09-10 06:38:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13608 states to 13608 states and 19479 transitions. [2019-09-10 06:38:04,947 INFO L78 Accepts]: Start accepts. Automaton has 13608 states and 19479 transitions. Word has length 66 [2019-09-10 06:38:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:04,948 INFO L475 AbstractCegarLoop]: Abstraction has 13608 states and 19479 transitions. [2019-09-10 06:38:04,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 13608 states and 19479 transitions. [2019-09-10 06:38:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:38:04,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:04,953 INFO L399 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-09-10 06:38:04,954 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash 810899746, now seen corresponding path program 1 times [2019-09-10 06:38:04,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:04,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:04,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:04,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:04,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:05,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:05,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:38:05,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:05,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:38:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:38:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:38:05,169 INFO L87 Difference]: Start difference. First operand 13608 states and 19479 transitions. Second operand 10 states. [2019-09-10 06:38:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:07,665 INFO L93 Difference]: Finished difference Result 59426 states and 84710 transitions. [2019-09-10 06:38:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:38:07,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-10 06:38:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:07,743 INFO L225 Difference]: With dead ends: 59426 [2019-09-10 06:38:07,743 INFO L226 Difference]: Without dead ends: 59426 [2019-09-10 06:38:07,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:38:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59426 states. [2019-09-10 06:38:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59426 to 13474. [2019-09-10 06:38:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13474 states. [2019-09-10 06:38:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13474 states to 13474 states and 19278 transitions. [2019-09-10 06:38:08,299 INFO L78 Accepts]: Start accepts. Automaton has 13474 states and 19278 transitions. Word has length 66 [2019-09-10 06:38:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:08,299 INFO L475 AbstractCegarLoop]: Abstraction has 13474 states and 19278 transitions. [2019-09-10 06:38:08,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 13474 states and 19278 transitions. [2019-09-10 06:38:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:38:08,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:08,305 INFO L399 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-09-10 06:38:08,305 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1139713951, now seen corresponding path program 1 times [2019-09-10 06:38:08,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:08,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:08,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:08,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:08,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:08,384 INFO L87 Difference]: Start difference. First operand 13474 states and 19278 transitions. Second operand 3 states. [2019-09-10 06:38:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:08,449 INFO L93 Difference]: Finished difference Result 13476 states and 18962 transitions. [2019-09-10 06:38:08,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:08,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:38:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:08,470 INFO L225 Difference]: With dead ends: 13476 [2019-09-10 06:38:08,470 INFO L226 Difference]: Without dead ends: 13476 [2019-09-10 06:38:08,471 INFO L628 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-09-10 06:38:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13476 states. [2019-09-10 06:38:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13476 to 13474. [2019-09-10 06:38:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13474 states. [2019-09-10 06:38:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13474 states to 13474 states and 18961 transitions. [2019-09-10 06:38:08,677 INFO L78 Accepts]: Start accepts. Automaton has 13474 states and 18961 transitions. Word has length 67 [2019-09-10 06:38:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:08,678 INFO L475 AbstractCegarLoop]: Abstraction has 13474 states and 18961 transitions. [2019-09-10 06:38:08,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13474 states and 18961 transitions. [2019-09-10 06:38:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:38:08,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:08,682 INFO L399 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-09-10 06:38:08,682 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1374992007, now seen corresponding path program 1 times [2019-09-10 06:38:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:08,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:08,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:08,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:08,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:08,742 INFO L87 Difference]: Start difference. First operand 13474 states and 18961 transitions. Second operand 3 states. [2019-09-10 06:38:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:08,790 INFO L93 Difference]: Finished difference Result 12096 states and 16722 transitions. [2019-09-10 06:38:08,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:08,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:38:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:08,805 INFO L225 Difference]: With dead ends: 12096 [2019-09-10 06:38:08,805 INFO L226 Difference]: Without dead ends: 12096 [2019-09-10 06:38:08,806 INFO L628 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-09-10 06:38:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12096 states. [2019-09-10 06:38:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12096 to 12094. [2019-09-10 06:38:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12094 states. [2019-09-10 06:38:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12094 states to 12094 states and 16721 transitions. [2019-09-10 06:38:08,945 INFO L78 Accepts]: Start accepts. Automaton has 12094 states and 16721 transitions. Word has length 67 [2019-09-10 06:38:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:08,946 INFO L475 AbstractCegarLoop]: Abstraction has 12094 states and 16721 transitions. [2019-09-10 06:38:08,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12094 states and 16721 transitions. [2019-09-10 06:38:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:38:08,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:08,950 INFO L399 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-09-10 06:38:08,950 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash 731179949, now seen corresponding path program 1 times [2019-09-10 06:38:08,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:08,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:09,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:09,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:09,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:09,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:09,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:09,013 INFO L87 Difference]: Start difference. First operand 12094 states and 16721 transitions. Second operand 3 states. [2019-09-10 06:38:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:09,078 INFO L93 Difference]: Finished difference Result 10309 states and 13954 transitions. [2019-09-10 06:38:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:09,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:38:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:09,094 INFO L225 Difference]: With dead ends: 10309 [2019-09-10 06:38:09,095 INFO L226 Difference]: Without dead ends: 10309 [2019-09-10 06:38:09,095 INFO L628 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-09-10 06:38:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10309 states. [2019-09-10 06:38:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10309 to 10307. [2019-09-10 06:38:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10307 states. [2019-09-10 06:38:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10307 states to 10307 states and 13953 transitions. [2019-09-10 06:38:09,789 INFO L78 Accepts]: Start accepts. Automaton has 10307 states and 13953 transitions. Word has length 67 [2019-09-10 06:38:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:09,789 INFO L475 AbstractCegarLoop]: Abstraction has 10307 states and 13953 transitions. [2019-09-10 06:38:09,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10307 states and 13953 transitions. [2019-09-10 06:38:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:38:09,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:09,793 INFO L399 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-09-10 06:38:09,793 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1663214200, now seen corresponding path program 1 times [2019-09-10 06:38:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:09,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:10,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:10,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:38:10,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:10,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:38:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:38:10,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:38:10,557 INFO L87 Difference]: Start difference. First operand 10307 states and 13953 transitions. Second operand 16 states. [2019-09-10 06:38:10,986 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:38:11,289 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 06:38:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:12,988 INFO L93 Difference]: Finished difference Result 18484 states and 25130 transitions. [2019-09-10 06:38:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:38:12,988 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-09-10 06:38:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:13,007 INFO L225 Difference]: With dead ends: 18484 [2019-09-10 06:38:13,007 INFO L226 Difference]: Without dead ends: 18484 [2019-09-10 06:38:13,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:38:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18484 states. [2019-09-10 06:38:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18484 to 10239. [2019-09-10 06:38:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10239 states. [2019-09-10 06:38:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 13860 transitions. [2019-09-10 06:38:13,136 INFO L78 Accepts]: Start accepts. Automaton has 10239 states and 13860 transitions. Word has length 68 [2019-09-10 06:38:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:13,137 INFO L475 AbstractCegarLoop]: Abstraction has 10239 states and 13860 transitions. [2019-09-10 06:38:13,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:38:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 10239 states and 13860 transitions. [2019-09-10 06:38:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:38:13,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:13,140 INFO L399 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-09-10 06:38:13,141 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1249568560, now seen corresponding path program 1 times [2019-09-10 06:38:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:13,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:13,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:13,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:14,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:14,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:38:14,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:14,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:38:14,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:38:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:38:14,164 INFO L87 Difference]: Start difference. First operand 10239 states and 13860 transitions. Second operand 18 states. [2019-09-10 06:38:14,800 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:38:15,185 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 06:38:15,547 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-09-10 06:38:15,801 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 06:38:16,032 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:38:16,651 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 06:38:16,871 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 06:38:17,053 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 06:38:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:18,834 INFO L93 Difference]: Finished difference Result 30385 states and 41445 transitions. [2019-09-10 06:38:18,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:38:18,835 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-09-10 06:38:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:18,868 INFO L225 Difference]: With dead ends: 30385 [2019-09-10 06:38:18,868 INFO L226 Difference]: Without dead ends: 30385 [2019-09-10 06:38:18,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:38:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30385 states. [2019-09-10 06:38:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30385 to 10201. [2019-09-10 06:38:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10201 states. [2019-09-10 06:38:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 13809 transitions. [2019-09-10 06:38:19,150 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 13809 transitions. Word has length 68 [2019-09-10 06:38:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:19,150 INFO L475 AbstractCegarLoop]: Abstraction has 10201 states and 13809 transitions. [2019-09-10 06:38:19,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:38:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 13809 transitions. [2019-09-10 06:38:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:38:19,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:19,154 INFO L399 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-09-10 06:38:19,155 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:19,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2039898992, now seen corresponding path program 1 times [2019-09-10 06:38:19,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:19,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:19,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:19,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:19,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:19,202 INFO L87 Difference]: Start difference. First operand 10201 states and 13809 transitions. Second operand 3 states. [2019-09-10 06:38:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:19,270 INFO L93 Difference]: Finished difference Result 15107 states and 20485 transitions. [2019-09-10 06:38:19,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:19,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:38:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:19,287 INFO L225 Difference]: With dead ends: 15107 [2019-09-10 06:38:19,287 INFO L226 Difference]: Without dead ends: 15107 [2019-09-10 06:38:19,288 INFO L628 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-09-10 06:38:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15107 states. [2019-09-10 06:38:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15107 to 10061. [2019-09-10 06:38:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10061 states. [2019-09-10 06:38:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10061 states to 10061 states and 13601 transitions. [2019-09-10 06:38:19,387 INFO L78 Accepts]: Start accepts. Automaton has 10061 states and 13601 transitions. Word has length 68 [2019-09-10 06:38:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:19,387 INFO L475 AbstractCegarLoop]: Abstraction has 10061 states and 13601 transitions. [2019-09-10 06:38:19,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10061 states and 13601 transitions. [2019-09-10 06:38:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:38:19,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:19,390 INFO L399 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-09-10 06:38:19,390 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1357870159, now seen corresponding path program 1 times [2019-09-10 06:38:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:19,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:19,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:19,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:19,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:19,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:19,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:19,432 INFO L87 Difference]: Start difference. First operand 10061 states and 13601 transitions. Second operand 3 states. [2019-09-10 06:38:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:19,511 INFO L93 Difference]: Finished difference Result 14913 states and 20198 transitions. [2019-09-10 06:38:19,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:19,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:38:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:19,533 INFO L225 Difference]: With dead ends: 14913 [2019-09-10 06:38:19,533 INFO L226 Difference]: Without dead ends: 14913 [2019-09-10 06:38:19,538 INFO L628 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-09-10 06:38:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14913 states. [2019-09-10 06:38:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14913 to 9867. [2019-09-10 06:38:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9867 states. [2019-09-10 06:38:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9867 states to 9867 states and 13330 transitions. [2019-09-10 06:38:19,685 INFO L78 Accepts]: Start accepts. Automaton has 9867 states and 13330 transitions. Word has length 68 [2019-09-10 06:38:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:19,686 INFO L475 AbstractCegarLoop]: Abstraction has 9867 states and 13330 transitions. [2019-09-10 06:38:19,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 9867 states and 13330 transitions. [2019-09-10 06:38:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:38:19,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:19,690 INFO L399 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-09-10 06:38:19,690 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:19,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:19,690 INFO L82 PathProgramCache]: Analyzing trace with hash -863267512, now seen corresponding path program 1 times [2019-09-10 06:38:19,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:19,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:19,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:20,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:20,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:38:20,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:20,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:38:20,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:38:20,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:38:20,166 INFO L87 Difference]: Start difference. First operand 9867 states and 13330 transitions. Second operand 11 states. [2019-09-10 06:38:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:21,027 INFO L93 Difference]: Finished difference Result 21166 states and 28722 transitions. [2019-09-10 06:38:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:38:21,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-09-10 06:38:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:21,045 INFO L225 Difference]: With dead ends: 21166 [2019-09-10 06:38:21,045 INFO L226 Difference]: Without dead ends: 21166 [2019-09-10 06:38:21,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:38:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21166 states. [2019-09-10 06:38:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21166 to 9735. [2019-09-10 06:38:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9735 states. [2019-09-10 06:38:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 13160 transitions. [2019-09-10 06:38:21,149 INFO L78 Accepts]: Start accepts. Automaton has 9735 states and 13160 transitions. Word has length 69 [2019-09-10 06:38:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:21,149 INFO L475 AbstractCegarLoop]: Abstraction has 9735 states and 13160 transitions. [2019-09-10 06:38:21,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:38:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 13160 transitions. [2019-09-10 06:38:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:38:21,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:21,152 INFO L399 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-09-10 06:38:21,152 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 941099548, now seen corresponding path program 1 times [2019-09-10 06:38:21,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:21,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:21,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:21,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:21,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:21,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:21,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:21,223 INFO L87 Difference]: Start difference. First operand 9735 states and 13160 transitions. Second operand 5 states. [2019-09-10 06:38:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:21,308 INFO L93 Difference]: Finished difference Result 9361 states and 12675 transitions. [2019-09-10 06:38:21,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:21,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 06:38:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:21,317 INFO L225 Difference]: With dead ends: 9361 [2019-09-10 06:38:21,318 INFO L226 Difference]: Without dead ends: 9361 [2019-09-10 06:38:21,318 INFO L628 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-09-10 06:38:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9361 states. [2019-09-10 06:38:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9361 to 9357. [2019-09-10 06:38:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9357 states. [2019-09-10 06:38:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9357 states to 9357 states and 12673 transitions. [2019-09-10 06:38:21,384 INFO L78 Accepts]: Start accepts. Automaton has 9357 states and 12673 transitions. Word has length 72 [2019-09-10 06:38:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:21,384 INFO L475 AbstractCegarLoop]: Abstraction has 9357 states and 12673 transitions. [2019-09-10 06:38:21,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 9357 states and 12673 transitions. [2019-09-10 06:38:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:38:21,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:21,387 INFO L399 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-09-10 06:38:21,387 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1594855658, now seen corresponding path program 1 times [2019-09-10 06:38:21,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:21,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:21,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:21,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:21,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:38:21,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:21,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:38:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:38:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:38:21,460 INFO L87 Difference]: Start difference. First operand 9357 states and 12673 transitions. Second operand 6 states. [2019-09-10 06:38:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:21,602 INFO L93 Difference]: Finished difference Result 17827 states and 23732 transitions. [2019-09-10 06:38:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:38:21,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-09-10 06:38:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:21,624 INFO L225 Difference]: With dead ends: 17827 [2019-09-10 06:38:21,624 INFO L226 Difference]: Without dead ends: 17827 [2019-09-10 06:38:21,625 INFO L628 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-09-10 06:38:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17827 states. [2019-09-10 06:38:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17827 to 9672. [2019-09-10 06:38:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9672 states. [2019-09-10 06:38:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9672 states to 9672 states and 12903 transitions. [2019-09-10 06:38:21,829 INFO L78 Accepts]: Start accepts. Automaton has 9672 states and 12903 transitions. Word has length 75 [2019-09-10 06:38:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:21,830 INFO L475 AbstractCegarLoop]: Abstraction has 9672 states and 12903 transitions. [2019-09-10 06:38:21,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:38:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 9672 states and 12903 transitions. [2019-09-10 06:38:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:38:21,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:21,833 INFO L399 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-09-10 06:38:21,833 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -242700483, now seen corresponding path program 1 times [2019-09-10 06:38:21,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:21,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:21,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:21,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:21,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:21,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:21,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:21,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:21,879 INFO L87 Difference]: Start difference. First operand 9672 states and 12903 transitions. Second operand 3 states. [2019-09-10 06:38:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:21,930 INFO L93 Difference]: Finished difference Result 17989 states and 23677 transitions. [2019-09-10 06:38:21,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:21,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:38:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:21,949 INFO L225 Difference]: With dead ends: 17989 [2019-09-10 06:38:21,950 INFO L226 Difference]: Without dead ends: 17989 [2019-09-10 06:38:21,950 INFO L628 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-09-10 06:38:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17989 states. [2019-09-10 06:38:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17989 to 16845. [2019-09-10 06:38:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-09-10 06:38:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 22298 transitions. [2019-09-10 06:38:22,100 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 22298 transitions. Word has length 76 [2019-09-10 06:38:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:22,100 INFO L475 AbstractCegarLoop]: Abstraction has 16845 states and 22298 transitions. [2019-09-10 06:38:22,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 22298 transitions. [2019-09-10 06:38:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:38:22,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:22,103 INFO L399 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-09-10 06:38:22,104 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2061431257, now seen corresponding path program 1 times [2019-09-10 06:38:22,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:22,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:22,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:22,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:22,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:22,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:22,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:22,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:22,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:22,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:22,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:22,150 INFO L87 Difference]: Start difference. First operand 16845 states and 22298 transitions. Second operand 3 states. [2019-09-10 06:38:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:22,247 INFO L93 Difference]: Finished difference Result 31209 states and 40515 transitions. [2019-09-10 06:38:22,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:22,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:38:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:22,290 INFO L225 Difference]: With dead ends: 31209 [2019-09-10 06:38:22,291 INFO L226 Difference]: Without dead ends: 31209 [2019-09-10 06:38:22,291 INFO L628 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-09-10 06:38:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31209 states. [2019-09-10 06:38:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31209 to 29135. [2019-09-10 06:38:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29135 states. [2019-09-10 06:38:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29135 states to 29135 states and 38134 transitions. [2019-09-10 06:38:22,566 INFO L78 Accepts]: Start accepts. Automaton has 29135 states and 38134 transitions. Word has length 77 [2019-09-10 06:38:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:22,566 INFO L475 AbstractCegarLoop]: Abstraction has 29135 states and 38134 transitions. [2019-09-10 06:38:22,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 29135 states and 38134 transitions. [2019-09-10 06:38:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:38:22,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:22,568 INFO L399 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-09-10 06:38:22,568 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash -936347122, now seen corresponding path program 1 times [2019-09-10 06:38:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:22,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:22,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:22,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:22,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:22,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:22,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:22,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:22,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:22,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:22,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:22,620 INFO L87 Difference]: Start difference. First operand 29135 states and 38134 transitions. Second operand 3 states. [2019-09-10 06:38:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:22,744 INFO L93 Difference]: Finished difference Result 43221 states and 55787 transitions. [2019-09-10 06:38:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:22,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:38:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:22,800 INFO L225 Difference]: With dead ends: 43221 [2019-09-10 06:38:22,800 INFO L226 Difference]: Without dead ends: 43221 [2019-09-10 06:38:22,801 INFO L628 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-09-10 06:38:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43221 states. [2019-09-10 06:38:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43221 to 43219. [2019-09-10 06:38:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43219 states. [2019-09-10 06:38:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43219 states to 43219 states and 55786 transitions. [2019-09-10 06:38:23,293 INFO L78 Accepts]: Start accepts. Automaton has 43219 states and 55786 transitions. Word has length 77 [2019-09-10 06:38:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:23,294 INFO L475 AbstractCegarLoop]: Abstraction has 43219 states and 55786 transitions. [2019-09-10 06:38:23,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 43219 states and 55786 transitions. [2019-09-10 06:38:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:38:23,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:23,303 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:23,303 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash -865004073, now seen corresponding path program 1 times [2019-09-10 06:38:23,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:23,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:23,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:23,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:23,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:23,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:23,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:23,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:23,391 INFO L87 Difference]: Start difference. First operand 43219 states and 55786 transitions. Second operand 5 states. [2019-09-10 06:38:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:24,082 INFO L93 Difference]: Finished difference Result 77578 states and 96700 transitions. [2019-09-10 06:38:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:38:24,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 06:38:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:24,180 INFO L225 Difference]: With dead ends: 77578 [2019-09-10 06:38:24,181 INFO L226 Difference]: Without dead ends: 77578 [2019-09-10 06:38:24,182 INFO L628 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-09-10 06:38:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77578 states. [2019-09-10 06:38:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77578 to 48031. [2019-09-10 06:38:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48031 states. [2019-09-10 06:38:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48031 states to 48031 states and 61264 transitions. [2019-09-10 06:38:24,650 INFO L78 Accepts]: Start accepts. Automaton has 48031 states and 61264 transitions. Word has length 95 [2019-09-10 06:38:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:24,651 INFO L475 AbstractCegarLoop]: Abstraction has 48031 states and 61264 transitions. [2019-09-10 06:38:24,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 48031 states and 61264 transitions. [2019-09-10 06:38:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:38:24,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:24,655 INFO L399 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-09-10 06:38:24,655 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash 408691093, now seen corresponding path program 1 times [2019-09-10 06:38:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:24,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:24,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:24,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:24,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:24,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:24,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:24,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:24,711 INFO L87 Difference]: Start difference. First operand 48031 states and 61264 transitions. Second operand 3 states. [2019-09-10 06:38:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:24,883 INFO L93 Difference]: Finished difference Result 90067 states and 111883 transitions. [2019-09-10 06:38:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:24,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 06:38:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:24,970 INFO L225 Difference]: With dead ends: 90067 [2019-09-10 06:38:24,971 INFO L226 Difference]: Without dead ends: 90067 [2019-09-10 06:38:24,971 INFO L628 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-09-10 06:38:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90067 states. [2019-09-10 06:38:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90067 to 78647. [2019-09-10 06:38:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78647 states. [2019-09-10 06:38:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78647 states to 78647 states and 98616 transitions. [2019-09-10 06:38:25,837 INFO L78 Accepts]: Start accepts. Automaton has 78647 states and 98616 transitions. Word has length 96 [2019-09-10 06:38:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:25,837 INFO L475 AbstractCegarLoop]: Abstraction has 78647 states and 98616 transitions. [2019-09-10 06:38:25,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 78647 states and 98616 transitions. [2019-09-10 06:38:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:38:25,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:25,842 INFO L399 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-09-10 06:38:25,842 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1281005310, now seen corresponding path program 1 times [2019-09-10 06:38:25,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:25,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:25,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:26,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:26,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:26,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:38:26,066 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-09-10 06:38:26,151 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:26,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:26,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:26,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:26,955 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-09-10 06:38:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:26,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:26,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:26,961 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) [2019-09-10 06:38:26,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:26,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:38:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:27,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:38:27,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:27,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:28,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:28,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:28,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:38:28,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2019-09-10 06:38:28,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:38:28,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:38:28,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:38:28,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:38:28,580 INFO L87 Difference]: Start difference. First operand 78647 states and 98616 transitions. Second operand 20 states. [2019-09-10 06:38:28,979 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:38:29,144 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:38:29,322 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 06:38:30,487 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 06:38:30,884 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-10 06:38:31,559 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 06:38:31,739 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 06:38:31,973 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 06:38:32,440 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:38:32,933 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:38:34,150 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:38:34,750 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:38:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:36,802 INFO L93 Difference]: Finished difference Result 155535 states and 191913 transitions. [2019-09-10 06:38:36,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:38:36,802 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-09-10 06:38:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:37,254 INFO L225 Difference]: With dead ends: 155535 [2019-09-10 06:38:37,254 INFO L226 Difference]: Without dead ends: 155535 [2019-09-10 06:38:37,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 176 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 06:38:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155535 states. [2019-09-10 06:38:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155535 to 102783. [2019-09-10 06:38:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102783 states. [2019-09-10 06:38:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102783 states to 102783 states and 128416 transitions. [2019-09-10 06:38:39,802 INFO L78 Accepts]: Start accepts. Automaton has 102783 states and 128416 transitions. Word has length 99 [2019-09-10 06:38:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:39,802 INFO L475 AbstractCegarLoop]: Abstraction has 102783 states and 128416 transitions. [2019-09-10 06:38:39,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:38:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 102783 states and 128416 transitions. [2019-09-10 06:38:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:38:39,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:39,817 INFO L399 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-09-10 06:38:39,818 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash -348827046, now seen corresponding path program 1 times [2019-09-10 06:38:39,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:39,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:39,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:39,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:39,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:39,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:39,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:38:39,988 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], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [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], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [424], [437], [445], [460], [472], [482], [514], [530], [535], [557], [558], [562], [563], [564] [2019-09-10 06:38:39,997 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:39,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:40,025 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:40,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:40,268 INFO L272 AbstractInterpreter]: Visited 93 different actions 356 times. Merged at 33 different actions 233 times. Widened at 12 different actions 35 times. Performed 1356 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1356 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 8 different actions. Largest state had 123 variables. [2019-09-10 06:38:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:40,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:40,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:40,268 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-09-10 06:38:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:40,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:40,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:38:40,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:40,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:40,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:41,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:41,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 06:38:41,608 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:38:41,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [5] total 24 [2019-09-10 06:38:41,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:41,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:38:41,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:38:41,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:38:41,610 INFO L87 Difference]: Start difference. First operand 102783 states and 128416 transitions. Second operand 12 states. [2019-09-10 06:38:41,777 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:38:43,324 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:38:43,604 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 06:38:45,925 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 06:38:46,380 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:38:46,622 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:38:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:47,775 INFO L93 Difference]: Finished difference Result 186217 states and 230926 transitions. [2019-09-10 06:38:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:38:47,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2019-09-10 06:38:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:48,057 INFO L225 Difference]: With dead ends: 186217 [2019-09-10 06:38:48,057 INFO L226 Difference]: Without dead ends: 186217 [2019-09-10 06:38:48,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:38:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186217 states. [2019-09-10 06:38:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186217 to 138369. [2019-09-10 06:38:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138369 states. [2019-09-10 06:38:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138369 states to 138369 states and 172744 transitions. [2019-09-10 06:38:52,117 INFO L78 Accepts]: Start accepts. Automaton has 138369 states and 172744 transitions. Word has length 99 [2019-09-10 06:38:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:52,118 INFO L475 AbstractCegarLoop]: Abstraction has 138369 states and 172744 transitions. [2019-09-10 06:38:52,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:38:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 138369 states and 172744 transitions. [2019-09-10 06:38:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:38:52,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:52,126 INFO L399 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, 1] [2019-09-10 06:38:52,126 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash -762547434, now seen corresponding path program 1 times [2019-09-10 06:38:52,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:52,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:52,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:52,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:52,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:52,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:38:52,226 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], [216], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [259], [261], [272], [298], [303], [314], [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-09-10 06:38:52,236 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:52,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:52,259 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:52,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:52,642 INFO L272 AbstractInterpreter]: Visited 94 different actions 390 times. Merged at 34 different actions 264 times. Widened at 13 different actions 46 times. Performed 1517 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1517 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 123 variables. [2019-09-10 06:38:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:52,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:52,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:52,643 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-09-10 06:38:52,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:52,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:52,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 06:38:52,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:52,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:38:53,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:38:53,922 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:38:53,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [5] total 25 [2019-09-10 06:38:53,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:53,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:38:53,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:38:53,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:38:53,924 INFO L87 Difference]: Start difference. First operand 138369 states and 172744 transitions. Second operand 12 states. [2019-09-10 06:38:54,453 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:38:55,028 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:38:55,562 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:38:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:56,915 INFO L93 Difference]: Finished difference Result 211081 states and 263249 transitions. [2019-09-10 06:38:56,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:38:56,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-10 06:38:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:57,147 INFO L225 Difference]: With dead ends: 211081 [2019-09-10 06:38:57,147 INFO L226 Difference]: Without dead ends: 211081 [2019-09-10 06:38:57,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:38:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211081 states. [2019-09-10 06:38:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211081 to 159795. [2019-09-10 06:38:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159795 states. [2019-09-10 06:38:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159795 states to 159795 states and 199278 transitions. [2019-09-10 06:38:59,280 INFO L78 Accepts]: Start accepts. Automaton has 159795 states and 199278 transitions. Word has length 100 [2019-09-10 06:38:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:59,280 INFO L475 AbstractCegarLoop]: Abstraction has 159795 states and 199278 transitions. [2019-09-10 06:38:59,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:38:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 159795 states and 199278 transitions. [2019-09-10 06:38:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:38:59,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:59,285 INFO L399 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, 1] [2019-09-10 06:38:59,286 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash 880493781, now seen corresponding path program 1 times [2019-09-10 06:38:59,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:59,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:59,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:59,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:59,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:59,393 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:38:59,394 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], [91], [95], [98], [101], [104], [106], [108], [111], [114], [118], [121], [124], [127], [135], [138], [149], [152], [163], [166], [169], [173], [176], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [259], [261], [270], [298], [303], [316], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [424], [437], [445], [460], [472], [482], [514], [530], [535], [557], [558], [562], [563], [564] [2019-09-10 06:38:59,396 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:59,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:59,425 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:59,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:59,738 INFO L272 AbstractInterpreter]: Visited 94 different actions 381 times. Merged at 34 different actions 256 times. Widened at 13 different actions 36 times. Performed 1524 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 8 different actions. Largest state had 123 variables. [2019-09-10 06:38:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:59,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:59,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:59,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 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-09-10 06:38:59,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:59,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:59,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:38:59,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:59,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:00,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:00,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:00,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2019-09-10 06:39:00,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:00,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:39:00,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:39:00,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:39:00,196 INFO L87 Difference]: Start difference. First operand 159795 states and 199278 transitions. Second operand 8 states. [2019-09-10 06:39:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:00,847 INFO L93 Difference]: Finished difference Result 250897 states and 310515 transitions. [2019-09-10 06:39:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:39:00,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-09-10 06:39:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:01,149 INFO L225 Difference]: With dead ends: 250897 [2019-09-10 06:39:01,149 INFO L226 Difference]: Without dead ends: 250897 [2019-09-10 06:39:01,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:39:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250897 states. [2019-09-10 06:39:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250897 to 207257. [2019-09-10 06:39:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207257 states. [2019-09-10 06:39:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207257 states to 207257 states and 258131 transitions. [2019-09-10 06:39:06,680 INFO L78 Accepts]: Start accepts. Automaton has 207257 states and 258131 transitions. Word has length 100 [2019-09-10 06:39:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:06,680 INFO L475 AbstractCegarLoop]: Abstraction has 207257 states and 258131 transitions. [2019-09-10 06:39:06,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:39:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 207257 states and 258131 transitions. [2019-09-10 06:39:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:39:06,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:06,691 INFO L399 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-09-10 06:39:06,692 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:06,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:06,692 INFO L82 PathProgramCache]: Analyzing trace with hash 25351875, now seen corresponding path program 1 times [2019-09-10 06:39:06,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:06,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:06,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:06,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:06,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:39:06,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:06,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:39:06,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:06,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:39:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:39:06,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:39:06,748 INFO L87 Difference]: Start difference. First operand 207257 states and 258131 transitions. Second operand 4 states. [2019-09-10 06:39:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:08,529 INFO L93 Difference]: Finished difference Result 266139 states and 331070 transitions. [2019-09-10 06:39:08,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:08,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-10 06:39:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:08,833 INFO L225 Difference]: With dead ends: 266139 [2019-09-10 06:39:08,833 INFO L226 Difference]: Without dead ends: 266139 [2019-09-10 06:39:08,834 INFO L628 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-09-10 06:39:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266139 states. [2019-09-10 06:39:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266139 to 193768. [2019-09-10 06:39:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193768 states. [2019-09-10 06:39:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193768 states to 193768 states and 241442 transitions. [2019-09-10 06:39:15,370 INFO L78 Accepts]: Start accepts. Automaton has 193768 states and 241442 transitions. Word has length 109 [2019-09-10 06:39:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:15,370 INFO L475 AbstractCegarLoop]: Abstraction has 193768 states and 241442 transitions. [2019-09-10 06:39:15,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:39:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 193768 states and 241442 transitions. [2019-09-10 06:39:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:39:15,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:15,379 INFO L399 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-09-10 06:39:15,379 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash -545064706, now seen corresponding path program 1 times [2019-09-10 06:39:15,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:15,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:15,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:15,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:15,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:15,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:15,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:39:15,444 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-09-10 06:39:15,446 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:15,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:15,460 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:15,604 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:39:15,605 INFO L272 AbstractInterpreter]: Visited 99 different actions 291 times. Merged at 32 different actions 169 times. Widened at 10 different actions 15 times. Performed 1091 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1091 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-09-10 06:39:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:15,605 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:39:15,858 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 83.54% of their original sizes. [2019-09-10 06:39:15,858 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:39:20,613 INFO L420 sIntCurrentIteration]: We unified 108 AI predicates to 108 [2019-09-10 06:39:20,613 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:39:20,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:39:20,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [71] imperfect sequences [5] total 74 [2019-09-10 06:39:20,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:20,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 06:39:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 06:39:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=4652, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 06:39:20,617 INFO L87 Difference]: Start difference. First operand 193768 states and 241442 transitions. Second operand 71 states. [2019-09-10 06:39:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:59,964 INFO L93 Difference]: Finished difference Result 245975 states and 306083 transitions. [2019-09-10 06:39:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 06:39:59,964 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 109 [2019-09-10 06:39:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:00,256 INFO L225 Difference]: With dead ends: 245975 [2019-09-10 06:40:00,256 INFO L226 Difference]: Without dead ends: 245975 [2019-09-10 06:40:00,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5706 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1394, Invalid=18066, Unknown=0, NotChecked=0, Total=19460 [2019-09-10 06:40:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245975 states. [2019-09-10 06:40:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245975 to 193847. [2019-09-10 06:40:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193847 states. [2019-09-10 06:40:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193847 states to 193847 states and 241513 transitions. [2019-09-10 06:40:02,360 INFO L78 Accepts]: Start accepts. Automaton has 193847 states and 241513 transitions. Word has length 109 [2019-09-10 06:40:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:02,360 INFO L475 AbstractCegarLoop]: Abstraction has 193847 states and 241513 transitions. [2019-09-10 06:40:02,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 06:40:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 193847 states and 241513 transitions. [2019-09-10 06:40:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:40:02,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:02,367 INFO L399 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-09-10 06:40:02,367 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -252514300, now seen corresponding path program 1 times [2019-09-10 06:40:02,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:02,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:02,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:02,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:02,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:02,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:40:02,432 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-09-10 06:40:02,435 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:02,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:02,448 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:02,550 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:40:02,551 INFO L272 AbstractInterpreter]: Visited 100 different actions 298 times. Merged at 32 different actions 175 times. Widened at 10 different actions 16 times. Performed 1101 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 4 different actions. Largest state had 125 variables. [2019-09-10 06:40:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:02,551 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:40:02,722 INFO L227 lantSequenceWeakener]: Weakened 84 states. On average, predicates are now at 83.43% of their original sizes. [2019-09-10 06:40:02,722 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:40:07,286 INFO L420 sIntCurrentIteration]: We unified 109 AI predicates to 109 [2019-09-10 06:40:07,286 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:40:07,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:40:07,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [5] total 70 [2019-09-10 06:40:07,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:07,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 06:40:07,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 06:40:07,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=4029, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 06:40:07,289 INFO L87 Difference]: Start difference. First operand 193847 states and 241513 transitions. Second operand 67 states. [2019-09-10 06:40:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:34,618 INFO L93 Difference]: Finished difference Result 232132 states and 289005 transitions. [2019-09-10 06:40:34,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 06:40:34,618 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 110 [2019-09-10 06:40:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:34,863 INFO L225 Difference]: With dead ends: 232132 [2019-09-10 06:40:34,863 INFO L226 Difference]: Without dead ends: 232132 [2019-09-10 06:40:34,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5733 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1652, Invalid=16708, Unknown=0, NotChecked=0, Total=18360 [2019-09-10 06:40:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232132 states. [2019-09-10 06:40:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232132 to 180756. [2019-09-10 06:40:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180756 states. [2019-09-10 06:40:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180756 states to 180756 states and 225330 transitions. [2019-09-10 06:40:37,213 INFO L78 Accepts]: Start accepts. Automaton has 180756 states and 225330 transitions. Word has length 110 [2019-09-10 06:40:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:37,213 INFO L475 AbstractCegarLoop]: Abstraction has 180756 states and 225330 transitions. [2019-09-10 06:40:37,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 06:40:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 180756 states and 225330 transitions. [2019-09-10 06:40:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:40:37,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:37,222 INFO L399 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] [2019-09-10 06:40:37,222 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash -704197470, now seen corresponding path program 1 times [2019-09-10 06:40:37,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:37,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:37,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:37,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:37,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:37,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:40:37,433 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], [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], [369], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [458], [463], [466], [484], [493], [509], [557], [558], [562], [563], [564] [2019-09-10 06:40:37,435 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:37,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:37,448 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:37,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:37,662 INFO L272 AbstractInterpreter]: Visited 108 different actions 438 times. Merged at 39 different actions 299 times. Widened at 15 different actions 45 times. Performed 1572 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 12 different actions. Largest state had 126 variables. [2019-09-10 06:40:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:37,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:37,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:37,663 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) [2019-09-10 06:40:37,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:37,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:37,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:40:37,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:38,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:39,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:39,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:39,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:39,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:39,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:39,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:39,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:39,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:44,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 14] total 30 [2019-09-10 06:40:44,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:44,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:40:44,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:40:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:40:44,090 INFO L87 Difference]: Start difference. First operand 180756 states and 225330 transitions. Second operand 22 states. [2019-09-10 06:40:44,801 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:40:46,919 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:40:47,358 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-10 06:40:48,409 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 06:40:48,596 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 06:40:50,654 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:40:50,993 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 06:40:51,749 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 06:40:56,583 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 06:40:56,929 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:41:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:06,119 INFO L93 Difference]: Finished difference Result 718965 states and 890145 transitions. [2019-09-10 06:41:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 06:41:06,123 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2019-09-10 06:41:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:06,996 INFO L225 Difference]: With dead ends: 718965 [2019-09-10 06:41:06,997 INFO L226 Difference]: Without dead ends: 718965 [2019-09-10 06:41:06,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 174 SyntacticMatches, 33 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4221 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2291, Invalid=10591, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 06:41:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718965 states. [2019-09-10 06:41:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718965 to 181830. [2019-09-10 06:41:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181830 states. [2019-09-10 06:41:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181830 states to 181830 states and 226606 transitions. [2019-09-10 06:41:11,993 INFO L78 Accepts]: Start accepts. Automaton has 181830 states and 226606 transitions. Word has length 113 [2019-09-10 06:41:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:11,993 INFO L475 AbstractCegarLoop]: Abstraction has 181830 states and 226606 transitions. [2019-09-10 06:41:11,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:41:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 181830 states and 226606 transitions. [2019-09-10 06:41:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:12,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:12,000 INFO L399 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-09-10 06:41:12,000 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash -228702936, now seen corresponding path program 1 times [2019-09-10 06:41:12,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:12,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:12,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:41:12,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:12,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:41:12,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:12,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:41:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:41:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:41:12,053 INFO L87 Difference]: Start difference. First operand 181830 states and 226606 transitions. Second operand 4 states. [2019-09-10 06:41:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:12,689 INFO L93 Difference]: Finished difference Result 196985 states and 245085 transitions. [2019-09-10 06:41:12,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:12,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 06:41:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:13,814 INFO L225 Difference]: With dead ends: 196985 [2019-09-10 06:41:13,814 INFO L226 Difference]: Without dead ends: 196985 [2019-09-10 06:41:13,814 INFO L628 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-09-10 06:41:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196985 states. [2019-09-10 06:41:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196985 to 181560. [2019-09-10 06:41:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181560 states. [2019-09-10 06:41:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181560 states to 181560 states and 226274 transitions. [2019-09-10 06:41:16,027 INFO L78 Accepts]: Start accepts. Automaton has 181560 states and 226274 transitions. Word has length 114 [2019-09-10 06:41:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:16,027 INFO L475 AbstractCegarLoop]: Abstraction has 181560 states and 226274 transitions. [2019-09-10 06:41:16,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:41:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 181560 states and 226274 transitions. [2019-09-10 06:41:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:16,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:16,033 INFO L399 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-09-10 06:41:16,033 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash 316800099, now seen corresponding path program 1 times [2019-09-10 06:41:16,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:16,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:16,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:16,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:16,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:16,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:16,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:16,354 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:41:16,354 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-09-10 06:41:16,356 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:16,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:16,366 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:16,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:16,527 INFO L272 AbstractInterpreter]: Visited 109 different actions 385 times. Merged at 41 different actions 252 times. Widened at 14 different actions 31 times. Performed 1410 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1410 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 9 different actions. Largest state had 126 variables. [2019-09-10 06:41:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:16,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:16,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:16,528 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) [2019-09-10 06:41:16,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:16,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:16,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:41:16,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:16,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:16,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:16,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:17,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:17,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:17,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 06:41:17,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:17,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:41:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:41:17,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:41:17,614 INFO L87 Difference]: Start difference. First operand 181560 states and 226274 transitions. Second operand 22 states. [2019-09-10 06:41:22,444 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 41 [2019-09-10 06:41:22,667 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 06:41:23,442 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-10 06:41:24,491 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-10 06:41:24,903 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-09-10 06:41:25,613 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-10 06:41:26,137 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-09-10 06:41:26,576 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-09-10 06:41:27,042 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-09-10 06:41:27,223 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-09-10 06:41:27,967 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-10 06:41:28,482 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-09-10 06:41:28,989 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2019-09-10 06:41:29,431 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-09-10 06:41:29,690 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-09-10 06:41:30,231 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:41:30,415 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2019-09-10 06:41:31,294 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-09-10 06:41:31,743 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:41:32,480 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-09-10 06:41:32,820 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 06:41:33,013 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:41:33,210 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 06:41:33,387 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-09-10 06:41:33,591 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 06:41:33,795 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 06:41:34,043 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-10 06:41:34,784 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 06:41:34,985 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 06:41:35,160 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-10 06:41:35,506 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-09-10 06:41:35,712 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 06:41:36,220 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-09-10 06:41:36,524 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-09-10 06:41:36,817 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:41:37,208 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-09-10 06:41:37,416 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-09-10 06:41:37,591 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-10 06:41:37,763 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-10 06:41:37,969 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-09-10 06:41:38,356 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-09-10 06:41:38,564 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-09-10 06:41:38,719 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2019-09-10 06:41:39,281 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:41:39,775 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2019-09-10 06:41:39,953 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 06:41:40,290 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:41:40,789 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 06:41:41,201 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2019-09-10 06:41:41,423 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-09-10 06:41:41,910 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2019-09-10 06:41:42,417 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2019-09-10 06:41:42,772 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 06:41:42,940 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:41:43,128 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 06:41:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:49,615 INFO L93 Difference]: Finished difference Result 677544 states and 837855 transitions. [2019-09-10 06:41:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-10 06:41:49,616 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 114 [2019-09-10 06:41:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:50,435 INFO L225 Difference]: With dead ends: 677544 [2019-09-10 06:41:50,435 INFO L226 Difference]: Without dead ends: 677544 [2019-09-10 06:41:50,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=5367, Invalid=22689, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 06:41:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677544 states. [2019-09-10 06:41:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677544 to 181548. [2019-09-10 06:41:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181548 states. [2019-09-10 06:41:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181548 states to 181548 states and 226261 transitions. [2019-09-10 06:41:59,427 INFO L78 Accepts]: Start accepts. Automaton has 181548 states and 226261 transitions. Word has length 114 [2019-09-10 06:41:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:59,427 INFO L475 AbstractCegarLoop]: Abstraction has 181548 states and 226261 transitions. [2019-09-10 06:41:59,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:41:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 181548 states and 226261 transitions. [2019-09-10 06:41:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:41:59,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:59,432 INFO L399 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-09-10 06:41:59,433 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 241865503, now seen corresponding path program 1 times [2019-09-10 06:41:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:59,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:59,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:41:59,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:59,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:59,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:59,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:59,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:59,484 INFO L87 Difference]: Start difference. First operand 181548 states and 226261 transitions. Second operand 3 states. [2019-09-10 06:42:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:00,411 INFO L93 Difference]: Finished difference Result 178989 states and 221147 transitions. [2019-09-10 06:42:00,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:42:00,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:42:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:00,589 INFO L225 Difference]: With dead ends: 178989 [2019-09-10 06:42:00,589 INFO L226 Difference]: Without dead ends: 178989 [2019-09-10 06:42:00,590 INFO L628 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-09-10 06:42:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178989 states. [2019-09-10 06:42:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178989 to 178989. [2019-09-10 06:42:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178989 states. [2019-09-10 06:42:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178989 states to 178989 states and 221147 transitions. [2019-09-10 06:42:04,885 INFO L78 Accepts]: Start accepts. Automaton has 178989 states and 221147 transitions. Word has length 114 [2019-09-10 06:42:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:04,886 INFO L475 AbstractCegarLoop]: Abstraction has 178989 states and 221147 transitions. [2019-09-10 06:42:04,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:42:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 178989 states and 221147 transitions. [2019-09-10 06:42:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:42:04,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:04,891 INFO L399 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-09-10 06:42:04,891 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:04,891 INFO L82 PathProgramCache]: Analyzing trace with hash 180935101, now seen corresponding path program 1 times [2019-09-10 06:42:04,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:04,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:04,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:05,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:05,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:05,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 06:42:05,209 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-09-10 06:42:05,210 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:05,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:05,221 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:05,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:05,408 INFO L272 AbstractInterpreter]: Visited 109 different actions 483 times. Merged at 41 different actions 341 times. Widened at 15 different actions 62 times. Performed 1650 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 126 variables. [2019-09-10 06:42:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:05,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:05,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:05,409 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-09-10 06:42:05,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:05,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:05,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:42:05,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:05,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:05,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:06,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:06,388 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:42:06,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-09-10 06:42:06,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:06,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:42:06,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:42:06,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:42:06,389 INFO L87 Difference]: Start difference. First operand 178989 states and 221147 transitions. Second operand 12 states. [2019-09-10 06:42:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:09,009 INFO L93 Difference]: Finished difference Result 246351 states and 303029 transitions. [2019-09-10 06:42:09,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:42:09,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-09-10 06:42:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:09,273 INFO L225 Difference]: With dead ends: 246351 [2019-09-10 06:42:09,273 INFO L226 Difference]: Without dead ends: 246351 [2019-09-10 06:42:09,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=321, Invalid=1935, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:42:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246351 states. [2019-09-10 06:42:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246351 to 208379. [2019-09-10 06:42:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208379 states. [2019-09-10 06:42:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208379 states to 208379 states and 257426 transitions. [2019-09-10 06:42:14,238 INFO L78 Accepts]: Start accepts. Automaton has 208379 states and 257426 transitions. Word has length 114 [2019-09-10 06:42:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:14,239 INFO L475 AbstractCegarLoop]: Abstraction has 208379 states and 257426 transitions. [2019-09-10 06:42:14,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:42:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 208379 states and 257426 transitions. [2019-09-10 06:42:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:42:14,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:14,248 INFO L399 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-09-10 06:42:14,248 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1108115292, now seen corresponding path program 1 times [2019-09-10 06:42:14,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:14,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:14,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:14,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:14,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:14,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:14,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:14,651 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:42:14,651 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], [206], [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], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [458], [463], [466], [484], [493], [509], [557], [558], [562], [563], [564] [2019-09-10 06:42:14,659 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:14,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:14,673 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:14,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:14,922 INFO L272 AbstractInterpreter]: Visited 110 different actions 508 times. Merged at 41 different actions 367 times. Widened at 16 different actions 63 times. Performed 1848 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 12 different actions. Largest state had 126 variables. [2019-09-10 06:42:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:14,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:14,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:14,922 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-09-10 06:42:14,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:14,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:15,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:42:15,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:15,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:15,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:15,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 30 [2019-09-10 06:42:15,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:15,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:42:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:42:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:42:15,853 INFO L87 Difference]: Start difference. First operand 208379 states and 257426 transitions. Second operand 24 states. [2019-09-10 06:42:16,461 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-10 06:42:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:20,113 INFO L93 Difference]: Finished difference Result 661752 states and 812450 transitions. [2019-09-10 06:42:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:42:20,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 115 [2019-09-10 06:42:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:20,900 INFO L225 Difference]: With dead ends: 661752 [2019-09-10 06:42:20,900 INFO L226 Difference]: Without dead ends: 661752 [2019-09-10 06:42:20,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=407, Invalid=1849, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:42:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661752 states. [2019-09-10 06:42:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661752 to 208409. [2019-09-10 06:42:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208409 states. [2019-09-10 06:42:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208409 states to 208409 states and 257456 transitions. [2019-09-10 06:42:30,410 INFO L78 Accepts]: Start accepts. Automaton has 208409 states and 257456 transitions. Word has length 115 [2019-09-10 06:42:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:30,410 INFO L475 AbstractCegarLoop]: Abstraction has 208409 states and 257456 transitions. [2019-09-10 06:42:30,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:42:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 208409 states and 257456 transitions. [2019-09-10 06:42:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:42:31,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:31,024 INFO L399 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-09-10 06:42:31,025 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:31,025 INFO L82 PathProgramCache]: Analyzing trace with hash 21345080, now seen corresponding path program 1 times [2019-09-10 06:42:31,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:31,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:31,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:42:31,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:31,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:42:31,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:31,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:42:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:42:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:42:31,085 INFO L87 Difference]: Start difference. First operand 208409 states and 257456 transitions. Second operand 3 states. [2019-09-10 06:42:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:31,596 INFO L93 Difference]: Finished difference Result 198394 states and 243189 transitions. [2019-09-10 06:42:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:42:31,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:42:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:31,821 INFO L225 Difference]: With dead ends: 198394 [2019-09-10 06:42:31,821 INFO L226 Difference]: Without dead ends: 198394 [2019-09-10 06:42:31,821 INFO L628 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-09-10 06:42:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198394 states. [2019-09-10 06:42:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198394 to 198266. [2019-09-10 06:42:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198266 states. [2019-09-10 06:42:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198266 states to 198266 states and 243060 transitions. [2019-09-10 06:42:34,225 INFO L78 Accepts]: Start accepts. Automaton has 198266 states and 243060 transitions. Word has length 115 [2019-09-10 06:42:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:34,228 INFO L475 AbstractCegarLoop]: Abstraction has 198266 states and 243060 transitions. [2019-09-10 06:42:34,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:42:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 198266 states and 243060 transitions. [2019-09-10 06:42:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:34,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:34,235 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:42:34,235 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1317294412, now seen corresponding path program 1 times [2019-09-10 06:42:34,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:34,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:34,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:34,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:42:34,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:34,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:42:34,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:42:34,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:42:34,299 INFO L87 Difference]: Start difference. First operand 198266 states and 243060 transitions. Second operand 3 states. [2019-09-10 06:42:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:34,693 INFO L93 Difference]: Finished difference Result 181003 states and 216334 transitions. [2019-09-10 06:42:34,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:42:34,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 06:42:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:34,852 INFO L225 Difference]: With dead ends: 181003 [2019-09-10 06:42:34,852 INFO L226 Difference]: Without dead ends: 181003 [2019-09-10 06:42:34,852 INFO L628 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-09-10 06:42:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181003 states. [2019-09-10 06:42:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181003 to 181001. [2019-09-10 06:42:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181001 states. [2019-09-10 06:42:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181001 states to 181001 states and 216333 transitions. [2019-09-10 06:42:37,311 INFO L78 Accepts]: Start accepts. Automaton has 181001 states and 216333 transitions. Word has length 116 [2019-09-10 06:42:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:37,311 INFO L475 AbstractCegarLoop]: Abstraction has 181001 states and 216333 transitions. [2019-09-10 06:42:37,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:42:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 181001 states and 216333 transitions. [2019-09-10 06:42:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:37,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:37,315 INFO L399 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-09-10 06:42:37,315 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1939437967, now seen corresponding path program 1 times [2019-09-10 06:42:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:37,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:37,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:42:37,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:37,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:42:37,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:37,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:42:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:42:37,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:42:37,742 INFO L87 Difference]: Start difference. First operand 181001 states and 216333 transitions. Second operand 11 states. [2019-09-10 06:42:37,961 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 06:42:38,112 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:42:38,278 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:42:38,445 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:42:38,743 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:42:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:42,806 INFO L93 Difference]: Finished difference Result 464922 states and 557774 transitions. [2019-09-10 06:42:42,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:42:42,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-09-10 06:42:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:43,333 INFO L225 Difference]: With dead ends: 464922 [2019-09-10 06:42:43,334 INFO L226 Difference]: Without dead ends: 464922 [2019-09-10 06:42:43,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:42:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464922 states. [2019-09-10 06:42:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464922 to 180846. [2019-09-10 06:42:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180846 states. [2019-09-10 06:42:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180846 states to 180846 states and 216168 transitions. [2019-09-10 06:42:49,349 INFO L78 Accepts]: Start accepts. Automaton has 180846 states and 216168 transitions. Word has length 116 [2019-09-10 06:42:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:49,350 INFO L475 AbstractCegarLoop]: Abstraction has 180846 states and 216168 transitions. [2019-09-10 06:42:49,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:42:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 180846 states and 216168 transitions. [2019-09-10 06:42:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:42:49,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:49,353 INFO L399 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-09-10 06:42:49,353 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1885045069, now seen corresponding path program 1 times [2019-09-10 06:42:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:49,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:50,267 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 14 [2019-09-10 06:42:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:50,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:50,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:50,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:42:50,388 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-09-10 06:42:50,390 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:50,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:50,400 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:50,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:50,579 INFO L272 AbstractInterpreter]: Visited 111 different actions 432 times. Merged at 42 different actions 296 times. Widened at 14 different actions 38 times. Performed 1592 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1592 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 12 different actions. Largest state had 126 variables. [2019-09-10 06:42:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:50,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:50,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:50,580 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-09-10 06:42:50,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:50,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:50,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:42:50,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:50,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:50,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:50,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:50,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:52,399 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:52,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:52,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:52,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:52,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2019-09-10 06:42:52,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:52,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:42:52,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:42:52,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:42:52,619 INFO L87 Difference]: Start difference. First operand 180846 states and 216168 transitions. Second operand 22 states. [2019-09-10 06:42:53,347 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-09-10 06:42:56,015 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 06:42:56,333 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-10 06:42:56,931 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 06:42:57,305 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 06:42:57,693 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:42:58,492 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 06:42:58,689 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:42:59,441 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 06:43:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:00,766 INFO L93 Difference]: Finished difference Result 437666 states and 522925 transitions. [2019-09-10 06:43:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:43:00,767 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 116 [2019-09-10 06:43:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:01,258 INFO L225 Difference]: With dead ends: 437666 [2019-09-10 06:43:01,258 INFO L226 Difference]: Without dead ends: 437666 [2019-09-10 06:43:01,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 200 SyntacticMatches, 21 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:43:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437666 states. [2019-09-10 06:43:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437666 to 180855. [2019-09-10 06:43:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180855 states. [2019-09-10 06:43:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180855 states to 180855 states and 216177 transitions. [2019-09-10 06:43:04,806 INFO L78 Accepts]: Start accepts. Automaton has 180855 states and 216177 transitions. Word has length 116 [2019-09-10 06:43:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:04,807 INFO L475 AbstractCegarLoop]: Abstraction has 180855 states and 216177 transitions. [2019-09-10 06:43:04,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:43:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 180855 states and 216177 transitions. [2019-09-10 06:43:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:43:04,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:04,810 INFO L399 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-09-10 06:43:04,810 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1704779235, now seen corresponding path program 1 times [2019-09-10 06:43:04,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:04,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:04,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:04,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:05,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:43:05,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:43:05,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:43:05,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:43:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:43:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:43:05,459 INFO L87 Difference]: Start difference. First operand 180855 states and 216177 transitions. Second operand 18 states. [2019-09-10 06:43:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:08,630 INFO L93 Difference]: Finished difference Result 212593 states and 252869 transitions. [2019-09-10 06:43:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:43:08,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 116 [2019-09-10 06:43:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:08,837 INFO L225 Difference]: With dead ends: 212593 [2019-09-10 06:43:08,837 INFO L226 Difference]: Without dead ends: 212593 [2019-09-10 06:43:08,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=447, Invalid=1275, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:43:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212593 states. [2019-09-10 06:43:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212593 to 180493. [2019-09-10 06:43:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180493 states. [2019-09-10 06:43:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180493 states to 180493 states and 215586 transitions. [2019-09-10 06:43:10,894 INFO L78 Accepts]: Start accepts. Automaton has 180493 states and 215586 transitions. Word has length 116 [2019-09-10 06:43:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:10,895 INFO L475 AbstractCegarLoop]: Abstraction has 180493 states and 215586 transitions. [2019-09-10 06:43:10,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:43:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 180493 states and 215586 transitions. [2019-09-10 06:43:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:43:10,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:10,898 INFO L399 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-09-10 06:43:10,898 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash 616688292, now seen corresponding path program 1 times [2019-09-10 06:43:10,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:10,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:10,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:11,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:11,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:11,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:43:11,602 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], [259], [261], [272], [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-09-10 06:43:11,605 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:11,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:11,614 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:11,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:11,777 INFO L272 AbstractInterpreter]: Visited 113 different actions 457 times. Merged at 40 different actions 317 times. Widened at 14 different actions 40 times. Performed 1663 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1663 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 9 different actions. Largest state had 127 variables. [2019-09-10 06:43:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:11,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:11,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:11,778 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) [2019-09-10 06:43:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:11,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:43:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:12,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:43:12,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:12,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:13,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:14,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:16,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:16,360 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 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:43:16,373 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:43:16,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [22] total 42 [2019-09-10 06:43:16,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:43:16,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:43:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:43:16,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:43:16,375 INFO L87 Difference]: Start difference. First operand 180493 states and 215586 transitions. Second operand 12 states. [2019-09-10 06:43:16,597 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 06:43:17,461 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:43:18,126 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:43:18,722 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:43:19,024 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:43:19,464 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:43:19,952 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:43:20,381 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:43:20,721 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:43:21,033 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:43:21,360 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:43:21,800 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:43:22,036 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:43:22,299 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:43:22,604 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:43:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:23,884 INFO L93 Difference]: Finished difference Result 210620 states and 250744 transitions. [2019-09-10 06:43:23,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:43:23,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-10 06:43:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:24,133 INFO L225 Difference]: With dead ends: 210620 [2019-09-10 06:43:24,133 INFO L226 Difference]: Without dead ends: 210620 [2019-09-10 06:43:24,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 199 SyntacticMatches, 18 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=446, Invalid=2746, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:43:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210620 states. [2019-09-10 06:43:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210620 to 194351. [2019-09-10 06:43:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194351 states. [2019-09-10 06:43:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194351 states to 194351 states and 232175 transitions. [2019-09-10 06:43:26,310 INFO L78 Accepts]: Start accepts. Automaton has 194351 states and 232175 transitions. Word has length 118 [2019-09-10 06:43:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:26,310 INFO L475 AbstractCegarLoop]: Abstraction has 194351 states and 232175 transitions. [2019-09-10 06:43:26,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:43:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 194351 states and 232175 transitions. [2019-09-10 06:43:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:43:26,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:26,314 INFO L399 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-09-10 06:43:26,314 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash -132390513, now seen corresponding path program 1 times [2019-09-10 06:43:26,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:26,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:26,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:26,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:26,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:26,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:43:26,757 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-09-10 06:43:26,759 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:26,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:26,766 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:26,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:26,970 INFO L272 AbstractInterpreter]: Visited 113 different actions 455 times. Merged at 40 different actions 309 times. Widened at 14 different actions 54 times. Performed 1647 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1647 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 13 different actions. Largest state had 127 variables. [2019-09-10 06:43:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:26,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:26,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:26,970 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) [2019-09-10 06:43:26,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:26,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:43:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:27,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:43:27,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:27,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:27,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:28,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:30,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:30,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:43:30,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 38 [2019-09-10 06:43:30,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:43:30,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:43:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:43:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:43:30,161 INFO L87 Difference]: Start difference. First operand 194351 states and 232175 transitions. Second operand 28 states. [2019-09-10 06:43:30,358 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:43:31,436 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:43:31,918 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:43:32,308 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:43:32,838 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:43:33,289 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 06:43:33,903 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:43:34,486 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:43:34,917 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 06:43:35,688 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:43:35,992 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 06:43:36,388 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-10 06:43:36,892 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:43:37,424 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 06:43:37,719 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:43:38,541 WARN L188 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:43:38,879 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-09-10 06:43:39,352 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 06:43:39,984 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 06:43:40,329 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:43:41,030 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-09-10 06:43:41,511 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:43:41,958 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-09-10 06:43:42,638 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-09-10 06:43:43,236 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-09-10 06:43:43,633 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:43:44,409 WARN L188 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 06:43:44,894 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:43:45,427 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-09-10 06:43:46,095 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-09-10 06:43:46,487 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 06:43:47,251 WARN L188 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 06:43:47,814 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-09-10 06:43:48,287 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 06:43:48,855 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 06:43:49,402 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 06:43:49,708 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:43:50,102 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:43:50,508 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:43:51,078 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-09-10 06:43:51,639 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-09-10 06:43:52,255 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:43:52,841 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:43:53,365 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2019-09-10 06:43:53,858 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 06:43:54,358 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 06:43:55,162 WARN L188 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 06:43:55,460 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:56,328 WARN L188 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-10 06:43:56,757 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 06:43:57,671 WARN L188 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-09-10 06:43:58,038 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:43:58,600 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-09-10 06:43:59,225 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 06:43:59,973 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:44:00,368 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-09-10 06:44:00,938 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 06:44:01,846 WARN L188 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2019-09-10 06:44:02,241 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:44:02,820 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-09-10 06:44:03,304 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-09-10 06:44:04,088 WARN L188 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 06:44:04,853 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-10 06:44:05,198 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:44:06,389 WARN L188 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-09-10 06:44:06,970 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:44:07,677 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-09-10 06:44:08,260 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 06:44:08,953 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:44:09,301 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:44:09,793 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:44:10,174 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:44:10,489 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:44:10,974 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:44:11,471 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:44:12,151 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:44:12,639 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:44:13,014 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:44:13,416 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:44:14,110 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 06:44:14,587 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:44:14,968 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-10 06:44:15,664 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:44:16,069 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 06:44:16,846 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 06:44:17,587 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:44:18,159 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 06:44:18,825 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-09-10 06:44:19,245 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:44:20,096 WARN L188 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 06:44:20,867 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:44:21,644 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-09-10 06:44:22,716 WARN L188 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 06:44:23,322 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-09-10 06:44:23,715 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:44:24,682 WARN L188 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 06:44:25,224 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 06:44:25,973 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-09-10 06:44:26,917 WARN L188 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 104 [2019-09-10 06:44:27,385 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 06:44:27,985 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:44:28,759 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-10 06:44:29,578 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-09-10 06:44:30,176 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2019-09-10 06:44:30,594 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:44:31,078 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:44:31,768 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:44:32,203 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 06:44:32,996 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-10 06:44:33,920 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 06:44:34,765 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-09-10 06:44:35,483 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-09-10 06:44:36,490 WARN L188 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2019-09-10 06:44:37,171 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2019-09-10 06:44:37,632 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-09-10 06:44:38,261 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:44:38,928 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-09-10 06:44:39,354 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:44:39,816 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 06:44:40,612 WARN L188 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2019-09-10 06:44:41,604 WARN L188 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2019-09-10 06:44:42,136 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-09-10 06:44:42,635 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:44:43,091 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:44:43,673 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 06:44:44,158 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:44:44,586 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-09-10 06:44:44,887 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:44:45,564 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-10 06:44:46,065 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:44:46,844 WARN L188 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 102 [2019-09-10 06:44:47,366 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:44:47,980 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 06:44:48,452 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-09-10 06:44:49,106 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:44:49,857 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 06:44:50,412 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-09-10 06:44:50,674 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:44:51,403 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:44:52,022 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:44:52,762 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:44:53,089 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 06:44:55,890 WARN L188 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-09-10 06:44:57,043 WARN L188 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2019-09-10 06:44:57,693 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-09-10 06:44:58,384 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:45:00,054 WARN L188 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-09-10 06:45:01,328 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:45:02,168 WARN L188 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-10 06:45:02,905 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:45:03,380 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:45:04,104 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-09-10 06:45:04,779 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-09-10 06:45:05,404 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 06:45:06,239 WARN L188 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-10 06:45:06,833 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:45:07,373 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:45:08,299 WARN L188 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 06:45:08,886 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2019-09-10 06:45:09,606 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:45:10,129 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:45:10,684 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:45:11,186 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:45:11,718 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-09-10 06:45:12,190 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-09-10 06:45:12,744 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:45:13,176 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-09-10 06:45:13,708 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-09-10 06:45:14,217 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 06:45:14,822 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-09-10 06:45:15,634 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-09-10 06:45:16,327 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:45:16,848 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:45:17,517 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 06:45:18,415 WARN L188 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-09-10 06:45:18,846 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 06:45:19,246 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-09-10 06:45:20,156 WARN L188 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:45:21,048 WARN L188 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-09-10 06:45:21,455 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:45:21,837 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 06:45:22,156 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:45:22,864 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-10 06:45:23,429 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-09-10 06:45:23,915 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-10 06:45:24,472 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:45:25,227 WARN L188 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:45:25,749 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-09-10 06:45:26,191 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:45:26,623 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:45:27,345 WARN L188 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:45:27,912 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2019-09-10 06:45:28,783 WARN L188 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-10 06:45:29,339 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 06:45:29,916 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:45:30,533 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:45:31,158 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:45:31,718 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:45:32,125 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:45:32,504 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:45:32,934 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:45:33,611 WARN L188 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 06:45:34,037 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 06:45:34,703 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 06:45:35,427 WARN L188 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 06:45:36,059 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:45:36,973 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:45:37,369 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:45:37,953 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 06:45:38,548 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-10 06:45:39,029 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:45:39,296 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:45:40,073 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:45:40,820 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:45:41,564 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 06:45:42,172 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-09-10 06:45:42,794 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:45:44,060 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:45:44,533 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 06:45:45,288 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:45:45,705 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-10 06:45:46,153 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:45:46,555 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:45:47,137 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 06:45:47,796 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-09-10 06:45:48,225 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:45:48,601 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 06:45:48,957 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:45:49,218 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:45:49,817 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-09-10 06:45:50,525 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-10 06:45:51,026 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 06:45:52,519 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:45:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:53,767 INFO L93 Difference]: Finished difference Result 487154 states and 578370 transitions. [2019-09-10 06:45:53,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2019-09-10 06:45:53,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2019-09-10 06:45:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:54,329 INFO L225 Difference]: With dead ends: 487154 [2019-09-10 06:45:54,329 INFO L226 Difference]: Without dead ends: 487154 [2019-09-10 06:45:54,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 185 SyntacticMatches, 32 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29285 ImplicationChecksByTransitivity, 124.4s TimeCoverageRelationStatistics Valid=10671, Invalid=64679, Unknown=0, NotChecked=0, Total=75350 [2019-09-10 06:45:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487154 states. [2019-09-10 06:45:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487154 to 205307. [2019-09-10 06:45:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205307 states. [2019-09-10 06:45:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205307 states to 205307 states and 245186 transitions. [2019-09-10 06:45:57,870 INFO L78 Accepts]: Start accepts. Automaton has 205307 states and 245186 transitions. Word has length 118 [2019-09-10 06:45:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:57,870 INFO L475 AbstractCegarLoop]: Abstraction has 205307 states and 245186 transitions. [2019-09-10 06:45:57,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:45:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 205307 states and 245186 transitions. [2019-09-10 06:45:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:45:57,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:57,873 INFO L399 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-09-10 06:45:57,874 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1398326825, now seen corresponding path program 1 times [2019-09-10 06:45:57,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:57,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:57,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:59,336 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-09-10 06:45:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:59,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:59,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:59,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 06:45:59,711 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], [222], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [305], [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-09-10 06:45:59,713 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:59,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:59,720 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:59,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:59,869 INFO L272 AbstractInterpreter]: Visited 115 different actions 479 times. Merged at 42 different actions 337 times. Widened at 14 different actions 51 times. Performed 1771 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1771 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-09-10 06:45:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:59,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:59,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:59,870 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-09-10 06:45:59,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:59,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:46:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:00,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 06:46:00,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:00,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:00,684 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-09-10 06:46:00,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:00,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:02,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:02,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:02,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:02,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:03,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:03,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:03,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:03,767 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:46:03,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:04,569 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2019-09-10 06:46:04,983 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-09-10 06:46:05,522 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-09-10 06:46:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 06:46:05,984 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 68 [2019-09-10 06:46:06,354 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 06:46:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:06,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:06,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 21] total 53 [2019-09-10 06:46:06,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:06,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 06:46:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 06:46:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2571, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:46:06,754 INFO L87 Difference]: Start difference. First operand 205307 states and 245186 transitions. Second operand 35 states. [2019-09-10 06:46:07,013 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 06:46:08,745 WARN L188 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-09-10 06:46:09,589 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:46:09,946 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:46:10,178 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-10 06:46:10,492 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:46:10,862 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 06:46:11,256 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:46:11,551 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:46:12,157 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:46:12,938 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 06:46:14,530 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-09-10 06:46:15,590 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:46:15,983 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 06:46:16,367 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:46:16,792 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 06:46:17,797 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-10 06:46:19,486 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-09-10 06:46:20,230 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 06:46:21,251 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 06:46:21,482 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:46:22,149 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2019-09-10 06:46:25,316 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 36 [2019-09-10 06:46:25,681 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 06:46:26,719 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:46:28,054 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:46:29,073 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2019-09-10 06:46:30,162 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2019-09-10 06:46:30,744 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-09-10 06:46:31,243 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 39 [2019-09-10 06:46:34,279 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-09-10 06:46:37,016 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-09-10 06:46:37,626 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2019-09-10 06:46:38,277 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 06:46:39,015 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2019-09-10 06:46:39,274 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:46:41,128 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 06:46:41,631 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:46:43,642 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2019-09-10 06:46:44,362 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-09-10 06:46:45,098 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-09-10 06:46:45,933 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2019-09-10 06:46:46,545 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 06:46:47,227 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 06:46:47,671 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 06:46:49,032 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 06:46:49,780 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:46:50,491 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-09-10 06:46:51,142 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 06:46:52,116 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 06:46:52,633 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2019-09-10 06:46:53,568 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 06:46:55,372 WARN L188 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-09-10 06:46:56,122 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2019-09-10 06:46:56,577 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 06:46:57,702 WARN L188 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2019-09-10 06:46:58,462 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2019-09-10 06:46:59,294 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-09-10 06:46:59,803 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 06:47:00,981 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-09-10 06:47:01,663 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 06:47:02,309 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 06:47:07,307 WARN L188 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-09-10 06:47:07,875 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 06:47:08,355 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-09-10 06:47:09,109 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2019-09-10 06:47:13,248 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 06:47:14,303 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2019-09-10 06:47:14,815 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:47:16,014 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-09-10 06:47:17,290 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:47:20,097 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-09-10 06:47:23,020 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:47:23,450 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 06:47:23,849 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 06:47:24,186 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 06:47:24,570 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:47:25,064 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 06:47:25,440 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:47:26,203 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 06:47:27,102 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-09-10 06:47:28,378 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 30 [2019-09-10 06:47:29,140 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2019-09-10 06:47:29,544 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 06:47:29,875 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 32 [2019-09-10 06:47:30,394 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:47:30,723 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 06:47:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:33,549 INFO L93 Difference]: Finished difference Result 543140 states and 649347 transitions. [2019-09-10 06:47:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-10 06:47:33,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 120 [2019-09-10 06:47:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:34,144 INFO L225 Difference]: With dead ends: 543140 [2019-09-10 06:47:34,144 INFO L226 Difference]: Without dead ends: 543140 [2019-09-10 06:47:34,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 199 SyntacticMatches, 6 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=3722, Invalid=18927, Unknown=1, NotChecked=0, Total=22650 [2019-09-10 06:47:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543140 states. [2019-09-10 06:47:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543140 to 205265. [2019-09-10 06:47:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205265 states. [2019-09-10 06:47:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205265 states to 205265 states and 245143 transitions. [2019-09-10 06:47:37,982 INFO L78 Accepts]: Start accepts. Automaton has 205265 states and 245143 transitions. Word has length 120 [2019-09-10 06:47:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:37,982 INFO L475 AbstractCegarLoop]: Abstraction has 205265 states and 245143 transitions. [2019-09-10 06:47:37,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 06:47:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 205265 states and 245143 transitions. [2019-09-10 06:47:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 06:47:37,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:37,987 INFO L399 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-09-10 06:47:37,987 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2077386324, now seen corresponding path program 1 times [2019-09-10 06:47:37,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:37,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:37,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:37,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:39,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:39,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:47:39,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:39,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:47:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:47:39,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:47:39,217 INFO L87 Difference]: Start difference. First operand 205265 states and 245143 transitions. Second operand 18 states. [2019-09-10 06:47:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:42,912 INFO L93 Difference]: Finished difference Result 284446 states and 339083 transitions. [2019-09-10 06:47:42,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:47:42,912 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 122 [2019-09-10 06:47:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:43,210 INFO L225 Difference]: With dead ends: 284446 [2019-09-10 06:47:43,210 INFO L226 Difference]: Without dead ends: 284446 [2019-09-10 06:47:43,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:47:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284446 states. [2019-09-10 06:47:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284446 to 205163. [2019-09-10 06:47:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205163 states. [2019-09-10 06:47:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205163 states to 205163 states and 245000 transitions. [2019-09-10 06:47:47,000 INFO L78 Accepts]: Start accepts. Automaton has 205163 states and 245000 transitions. Word has length 122 [2019-09-10 06:47:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:47,000 INFO L475 AbstractCegarLoop]: Abstraction has 205163 states and 245000 transitions. [2019-09-10 06:47:47,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:47:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 205163 states and 245000 transitions. [2019-09-10 06:47:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:47:47,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:47,004 INFO L399 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, 1] [2019-09-10 06:47:47,004 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:47,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1931419924, now seen corresponding path program 1 times [2019-09-10 06:47:47,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:47,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:47,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:47,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:47,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:47,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:47,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:47,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 06:47:47,617 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], [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], [259], [261], [263], [266], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [365], [371], [374], [377], [380], [382], [384], [424], [427], [430], [433], [435], [437], [463], [468], [475], [480], [557], [558], [562], [563], [564] [2019-09-10 06:47:47,618 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:47,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:47,627 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:47,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:47,772 INFO L272 AbstractInterpreter]: Visited 118 different actions 415 times. Merged at 43 different actions 275 times. Widened at 13 different actions 28 times. Performed 1488 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1488 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 127 variables. [2019-09-10 06:47:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:47,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:47,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:47,772 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) [2019-09-10 06:47:47,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:47,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:47:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:47,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:47:47,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:47,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:47,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:48,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:48,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:48,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:49,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2019-09-10 06:47:49,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:49,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:47:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:47:49,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:47:49,856 INFO L87 Difference]: Start difference. First operand 205163 states and 245000 transitions. Second operand 22 states. [2019-09-10 06:47:50,005 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 06:47:50,640 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 06:47:50,854 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 06:47:51,089 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-09-10 06:47:51,812 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:47:52,147 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 06:47:52,381 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 28 [2019-09-10 06:47:52,614 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2019-09-10 06:47:53,032 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 06:47:53,275 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2019-09-10 06:47:53,488 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:47:53,821 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:47:54,074 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:47:54,303 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-09-10 06:47:54,687 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:47:54,862 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 06:47:55,191 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 06:47:55,683 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 06:47:55,880 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:47:56,076 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2019-09-10 06:47:56,290 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 06:47:56,557 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2019-09-10 06:47:56,971 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:47:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:59,140 INFO L93 Difference]: Finished difference Result 309918 states and 366731 transitions. [2019-09-10 06:47:59,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 06:47:59,141 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 123 [2019-09-10 06:47:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:59,466 INFO L225 Difference]: With dead ends: 309918 [2019-09-10 06:47:59,466 INFO L226 Difference]: Without dead ends: 309918 [2019-09-10 06:47:59,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 226 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=822, Invalid=3468, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 06:47:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309918 states. [2019-09-10 06:48:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309918 to 217608. [2019-09-10 06:48:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217608 states. [2019-09-10 06:48:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217608 states to 217608 states and 259696 transitions. [2019-09-10 06:48:03,619 INFO L78 Accepts]: Start accepts. Automaton has 217608 states and 259696 transitions. Word has length 123 [2019-09-10 06:48:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:03,619 INFO L475 AbstractCegarLoop]: Abstraction has 217608 states and 259696 transitions. [2019-09-10 06:48:03,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:48:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 217608 states and 259696 transitions. [2019-09-10 06:48:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 06:48:03,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:03,628 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:48:03,629 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash 192911422, now seen corresponding path program 1 times [2019-09-10 06:48:03,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:03,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:03,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:03,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:03,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2019-09-10 06:48:03,685 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], [200], [208], [210], [213], [216], [219], [224], [226], [229], [232], [234], [236], [239], [240], [242], [245], [248], [251], [254], [259], [261], [263], [266], [274], [277], [280], [283], [285], [287], [305], [307], [310], [318], [321], [324], [327], [329], [331], [367], [371], [384], [392], [395], [398], [401], [403], [411], [424], [427], [430], [433], [435], [437], [460], [470], [514], [530], [557], [558], [562], [563], [564] [2019-09-10 06:48:03,686 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:03,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:03,696 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:03,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:03,836 INFO L272 AbstractInterpreter]: Visited 117 different actions 481 times. Merged at 49 different actions 319 times. Widened at 13 different actions 42 times. Performed 1672 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 13 different actions. Largest state had 127 variables. [2019-09-10 06:48:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:03,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:03,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:03,837 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-09-10 06:48:03,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:03,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:03,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:48:03,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:04,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:04,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:04,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-09-10 06:48:04,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:04,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:48:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:48:04,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:48:04,125 INFO L87 Difference]: Start difference. First operand 217608 states and 259696 transitions. Second operand 10 states. [2019-09-10 06:48:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:05,594 INFO L93 Difference]: Finished difference Result 241786 states and 283971 transitions. [2019-09-10 06:48:05,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:48:05,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-09-10 06:48:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:05,848 INFO L225 Difference]: With dead ends: 241786 [2019-09-10 06:48:05,848 INFO L226 Difference]: Without dead ends: 241786 [2019-09-10 06:48:05,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:48:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241786 states. [2019-09-10 06:48:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241786 to 192391. [2019-09-10 06:48:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192391 states. [2019-09-10 06:48:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192391 states to 192391 states and 227271 transitions. [2019-09-10 06:48:08,102 INFO L78 Accepts]: Start accepts. Automaton has 192391 states and 227271 transitions. Word has length 141 [2019-09-10 06:48:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:08,102 INFO L475 AbstractCegarLoop]: Abstraction has 192391 states and 227271 transitions. [2019-09-10 06:48:08,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:48:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 192391 states and 227271 transitions. [2019-09-10 06:48:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 06:48:08,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:08,112 INFO L399 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-09-10 06:48:08,112 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1379140528, now seen corresponding path program 1 times [2019-09-10 06:48:08,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 06:48:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 06:48:08,287 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 06:48:08,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:48:08 BoogieIcfgContainer [2019-09-10 06:48:08,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:48:08,489 INFO L168 Benchmark]: Toolchain (without parser) took 620045.59 ms. Allocated memory was 134.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 88.8 MB in the beginning and 792.5 MB in the end (delta: -703.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-09-10 06:48:08,489 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-10 06:48:08,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.21 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 88.6 MB in the beginning and 169.7 MB in the end (delta: -81.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:48:08,490 INFO L168 Benchmark]: Boogie Preprocessor took 72.34 ms. Allocated memory is still 200.8 MB. Free memory was 169.7 MB in the beginning and 167.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-09-10 06:48:08,492 INFO L168 Benchmark]: RCFGBuilder took 941.01 ms. Allocated memory is still 200.8 MB. Free memory was 167.2 MB in the beginning and 110.9 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:48:08,492 INFO L168 Benchmark]: TraceAbstraction took 618341.09 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 110.3 MB in the beginning and 792.5 MB in the end (delta: -682.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-09-10 06:48:08,493 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.22 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.21 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 88.6 MB in the beginning and 169.7 MB in the end (delta: -81.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.34 ms. Allocated memory is still 200.8 MB. Free memory was 169.7 MB in the beginning and 167.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 941.01 ms. Allocated memory is still 200.8 MB. Free memory was 167.2 MB in the beginning and 110.9 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 618341.09 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 110.3 MB in the beginning and 792.5 MB in the end (delta: -682.1 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=-1, node1__m1=127, 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=127, node1__m1=-1, 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=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] [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=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] [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=1, main____CPAchecker_TMP_0=0, 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=127, node1__m1=-1, 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=0, main____CPAchecker_TMP_0=1, 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] [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=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] [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=1, main____CPAchecker_TMP_0=0, 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] [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=1, main____CPAchecker_TMP_0=0, 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=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] [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=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] [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=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=2, mode1=1, mode2=0, 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] [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=-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] [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=-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] [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=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] [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=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] [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=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=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=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=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=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] [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=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=-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=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] [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=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] [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=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] [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=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=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] [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=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=-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] [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=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=-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] [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=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=-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] [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=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=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=2, main____CPAchecker_TMP_0=1, 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=-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] [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=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] [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=0, main____CPAchecker_TMP_0=2, 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] [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=2, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=3, 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=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=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=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=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=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=-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] [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=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] [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=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] [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=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] [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=2, main____CPAchecker_TMP_0=0, 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] [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=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=-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] [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=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] [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=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=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=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=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] [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=2, 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=-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] [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=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] [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=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] [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=3, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, 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] [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=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=2, 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] [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=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] [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=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=-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=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=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=3, main____CPAchecker_TMP_0=0, 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=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=-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=-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] [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=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] [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=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=-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=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=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__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=-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] [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=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=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=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=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=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=-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=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=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] [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=-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] [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=0, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, 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] [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=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] [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=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=-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] [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=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=3, 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=3, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=5, mode1=1, 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=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=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] [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=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=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] [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=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=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] [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=0, main____CPAchecker_TMP_0=4, 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] [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=0, main____CPAchecker_TMP_0=4, 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] [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=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] [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=-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] [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=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=-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] [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=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] [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=4, main____CPAchecker_TMP_0=0, 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] [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=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] [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=-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] [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=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=-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] [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=4, main____CPAchecker_TMP_0=0, 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=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] [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=1, check__tmp=1, check__tmp=0, 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=-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=1, check__tmp=1, check__tmp=0, 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=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] [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=1, assert__arg=1, assert__arg=0, check__tmp=1, check__tmp=0, 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=-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] [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=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=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=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=1, assert__arg=0, check__tmp=1, check__tmp=0, 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=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, 618.2s OverallTime, 55 OverallIterations, 4 TraceHistogramMax, 449.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15079 SDtfs, 72343 SDslu, 97786 SDs, 0 SdLazy, 56612 SolverSat, 3017 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 112.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4883 GetRequests, 2984 SyntacticMatches, 141 SemanticMatches, 1758 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65081 ImplicationChecksByTransitivity, 279.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217608occurred in iteration=53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 16 AbstIntIterations, 2 AbstIntStrong, 0.9861796375697263 AbsIntWeakeningRatio, 1.423963133640553 AbsIntAvgWeakeningVarsNumRemoved, 36.8479262672811 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 105.3s AutomataMinimizationTime, 54 MinimizatonAttempts, 3636612 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 41.7s InterpolantComputationTime, 6479 NumberOfCodeBlocks, 6479 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 7844 ConstructedInterpolants, 578 QuantifiedInterpolants, 10758645 SizeOfPredicates, 113 NumberOfNonLiveVariables, 10427 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 82 InterpolantComputations, 46 PerfectInterpolantSequences, 447/587 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...