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.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:01:35,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:01:35,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:01:35,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:01:35,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:01:35,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:01:35,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:01:35,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:01:35,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:01:35,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:01:35,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:01:35,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:01:35,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:01:35,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:01:35,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:01:35,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:01:35,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:01:35,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:01:35,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:01:35,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:01:35,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:01:35,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:01:35,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:01:35,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:01:35,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:01:35,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:01:35,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:01:35,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:01:35,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:01:35,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:01:35,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:01:35,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:01:35,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:01:35,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:01:35,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:01:35,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:01:35,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:01:35,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:01:35,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:01:35,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:01:35,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:01:35,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 03:01:35,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:01:35,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:01:35,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:01:35,300 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:01:35,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:01:35,301 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:01:35,301 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:01:35,301 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:01:35,302 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:01:35,302 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:01:35,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:01:35,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:01:35,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:01:35,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:01:35,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:01:35,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:01:35,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:01:35,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:01:35,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:01:35,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:01:35,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:01:35,307 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:01:35,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:01:35,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:01:35,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:01:35,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:01:35,308 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:01:35,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:01:35,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:01:35,309 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:01:35,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:01:35,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:01:35,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:01:35,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:01:35,387 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:01:35,388 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.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-03 03:01:35,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c5eb98f/9a5b331a43274dbeb4cd2b440acfc39c/FLAG5edf4edd5 [2019-10-03 03:01:35,954 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:01:35,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-03 03:01:35,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c5eb98f/9a5b331a43274dbeb4cd2b440acfc39c/FLAG5edf4edd5 [2019-10-03 03:01:36,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c5eb98f/9a5b331a43274dbeb4cd2b440acfc39c [2019-10-03 03:01:36,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:01:36,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:01:36,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:36,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:01:36,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:01:36,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:36,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c93ec65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36, skipping insertion in model container [2019-10-03 03:01:36,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:36,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:01:36,376 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:01:36,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:36,829 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:01:36,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:36,979 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:01:36,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36 WrapperNode [2019-10-03 03:01:36,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:36,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:01:36,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:01:36,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:01:36,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:36,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:37,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:37,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:37,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:37,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:37,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... [2019-10-03 03:01:37,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:01:37,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:01:37,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:01:37,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:01:37,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:01:37,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:01:37,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:01:37,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:01:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:01:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:01:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:01:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-03 03:01:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:01:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:01:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:01:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:01:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:01:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:01:37,125 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:01:37,125 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:01:37,125 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:01:37,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:01:37,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:01:37,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:01:37,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:01:37,978 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:01:37,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:01:37 BoogieIcfgContainer [2019-10-03 03:01:37,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:01:37,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:01:37,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:01:37,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:01:37,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:01:36" (1/3) ... [2019-10-03 03:01:37,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39475dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:01:37, skipping insertion in model container [2019-10-03 03:01:37,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:36" (2/3) ... [2019-10-03 03:01:37,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39475dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:01:37, skipping insertion in model container [2019-10-03 03:01:37,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:01:37" (3/3) ... [2019-10-03 03:01:37,988 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-03 03:01:37,998 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:01:38,007 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 03:01:38,024 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 03:01:38,050 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:01:38,050 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:01:38,050 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:01:38,050 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:01:38,050 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:01:38,051 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:01:38,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:01:38,051 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:01:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-03 03:01:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 03:01:38,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:38,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:38,085 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash -276696918, now seen corresponding path program 1 times [2019-10-03 03:01:38,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:38,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:38,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:38,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:38,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:38,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:38,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:38,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:38,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:38,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:38,601 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 6 states. [2019-10-03 03:01:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:39,009 INFO L93 Difference]: Finished difference Result 658 states and 1025 transitions. [2019-10-03 03:01:39,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:01:39,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-03 03:01:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:39,040 INFO L225 Difference]: With dead ends: 658 [2019-10-03 03:01:39,041 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 03:01:39,044 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:01:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 03:01:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 423. [2019-10-03 03:01:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-03 03:01:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-10-03 03:01:39,140 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 52 [2019-10-03 03:01:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:39,141 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-10-03 03:01:39,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-10-03 03:01:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:39,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:39,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:39,144 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:39,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:39,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1087729035, now seen corresponding path program 1 times [2019-10-03 03:01:39,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:39,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:39,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:39,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:39,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:39,309 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 3 states. [2019-10-03 03:01:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:39,350 INFO L93 Difference]: Finished difference Result 748 states and 1139 transitions. [2019-10-03 03:01:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:39,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-03 03:01:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:39,356 INFO L225 Difference]: With dead ends: 748 [2019-10-03 03:01:39,357 INFO L226 Difference]: Without dead ends: 748 [2019-10-03 03:01:39,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-03 03:01:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-10-03 03:01:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-03 03:01:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1138 transitions. [2019-10-03 03:01:39,406 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1138 transitions. Word has length 55 [2019-10-03 03:01:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:39,407 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1138 transitions. [2019-10-03 03:01:39,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1138 transitions. [2019-10-03 03:01:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:39,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:39,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:39,423 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash 917757431, now seen corresponding path program 1 times [2019-10-03 03:01:39,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:39,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:39,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:39,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:39,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:39,515 INFO L87 Difference]: Start difference. First operand 746 states and 1138 transitions. Second operand 3 states. [2019-10-03 03:01:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:39,565 INFO L93 Difference]: Finished difference Result 1335 states and 2002 transitions. [2019-10-03 03:01:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:39,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-03 03:01:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:39,573 INFO L225 Difference]: With dead ends: 1335 [2019-10-03 03:01:39,573 INFO L226 Difference]: Without dead ends: 1335 [2019-10-03 03:01:39,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-03 03:01:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-10-03 03:01:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-03 03:01:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2001 transitions. [2019-10-03 03:01:39,611 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2001 transitions. Word has length 55 [2019-10-03 03:01:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:39,612 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2001 transitions. [2019-10-03 03:01:39,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2001 transitions. [2019-10-03 03:01:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:01:39,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:39,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:39,614 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:39,615 INFO L82 PathProgramCache]: Analyzing trace with hash -41555275, now seen corresponding path program 1 times [2019-10-03 03:01:39,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:39,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:39,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:39,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:39,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:39,887 INFO L87 Difference]: Start difference. First operand 1333 states and 2001 transitions. Second operand 10 states. [2019-10-03 03:01:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:41,482 INFO L93 Difference]: Finished difference Result 7341 states and 11043 transitions. [2019-10-03 03:01:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:01:41,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-03 03:01:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:41,530 INFO L225 Difference]: With dead ends: 7341 [2019-10-03 03:01:41,530 INFO L226 Difference]: Without dead ends: 7341 [2019-10-03 03:01:41,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:01:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2019-10-03 03:01:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 1358. [2019-10-03 03:01:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-10-03 03:01:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2033 transitions. [2019-10-03 03:01:41,666 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2033 transitions. Word has length 56 [2019-10-03 03:01:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:41,666 INFO L475 AbstractCegarLoop]: Abstraction has 1358 states and 2033 transitions. [2019-10-03 03:01:41,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2033 transitions. [2019-10-03 03:01:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:01:41,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:41,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:41,669 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:41,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash -742667424, now seen corresponding path program 1 times [2019-10-03 03:01:41,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:41,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:41,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:41,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:41,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:41,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:41,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:01:41,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:41,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:01:41,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:01:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:41,815 INFO L87 Difference]: Start difference. First operand 1358 states and 2033 transitions. Second operand 7 states. [2019-10-03 03:01:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:42,404 INFO L93 Difference]: Finished difference Result 5246 states and 8009 transitions. [2019-10-03 03:01:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:01:42,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-10-03 03:01:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:42,431 INFO L225 Difference]: With dead ends: 5246 [2019-10-03 03:01:42,431 INFO L226 Difference]: Without dead ends: 5246 [2019-10-03 03:01:42,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:01:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-10-03 03:01:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 1339. [2019-10-03 03:01:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-03 03:01:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2009 transitions. [2019-10-03 03:01:42,504 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2009 transitions. Word has length 57 [2019-10-03 03:01:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:42,505 INFO L475 AbstractCegarLoop]: Abstraction has 1339 states and 2009 transitions. [2019-10-03 03:01:42,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:01:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2009 transitions. [2019-10-03 03:01:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:01:42,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:42,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:42,507 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1896016447, now seen corresponding path program 1 times [2019-10-03 03:01:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:42,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:42,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:42,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:42,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:42,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:42,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:42,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:42,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:42,626 INFO L87 Difference]: Start difference. First operand 1339 states and 2009 transitions. Second operand 9 states. [2019-10-03 03:01:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:44,130 INFO L93 Difference]: Finished difference Result 7351 states and 11042 transitions. [2019-10-03 03:01:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:01:44,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-03 03:01:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:44,166 INFO L225 Difference]: With dead ends: 7351 [2019-10-03 03:01:44,167 INFO L226 Difference]: Without dead ends: 7351 [2019-10-03 03:01:44,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:01:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2019-10-03 03:01:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 1378. [2019-10-03 03:01:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-10-03 03:01:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2060 transitions. [2019-10-03 03:01:44,262 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2060 transitions. Word has length 57 [2019-10-03 03:01:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:44,263 INFO L475 AbstractCegarLoop]: Abstraction has 1378 states and 2060 transitions. [2019-10-03 03:01:44,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2060 transitions. [2019-10-03 03:01:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:01:44,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:44,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:44,265 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1439125625, now seen corresponding path program 1 times [2019-10-03 03:01:44,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:44,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:44,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:44,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:44,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:44,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:44,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:01:44,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:44,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:01:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:01:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:44,356 INFO L87 Difference]: Start difference. First operand 1378 states and 2060 transitions. Second operand 7 states. [2019-10-03 03:01:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:44,856 INFO L93 Difference]: Finished difference Result 4520 states and 6757 transitions. [2019-10-03 03:01:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:01:44,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-03 03:01:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:44,891 INFO L225 Difference]: With dead ends: 4520 [2019-10-03 03:01:44,893 INFO L226 Difference]: Without dead ends: 4520 [2019-10-03 03:01:44,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:01:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-10-03 03:01:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1359. [2019-10-03 03:01:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-10-03 03:01:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2033 transitions. [2019-10-03 03:01:44,968 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2033 transitions. Word has length 58 [2019-10-03 03:01:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:44,968 INFO L475 AbstractCegarLoop]: Abstraction has 1359 states and 2033 transitions. [2019-10-03 03:01:44,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:01:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2033 transitions. [2019-10-03 03:01:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:01:44,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:44,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:44,970 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1839206206, now seen corresponding path program 1 times [2019-10-03 03:01:44,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:44,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:44,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:44,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:44,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:45,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:45,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:45,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:45,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:45,107 INFO L87 Difference]: Start difference. First operand 1359 states and 2033 transitions. Second operand 9 states. [2019-10-03 03:01:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:45,964 INFO L93 Difference]: Finished difference Result 6095 states and 9116 transitions. [2019-10-03 03:01:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:01:45,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-03 03:01:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:45,979 INFO L225 Difference]: With dead ends: 6095 [2019-10-03 03:01:45,979 INFO L226 Difference]: Without dead ends: 6095 [2019-10-03 03:01:45,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:01:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-10-03 03:01:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3782. [2019-10-03 03:01:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-10-03 03:01:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5672 transitions. [2019-10-03 03:01:46,062 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5672 transitions. Word has length 58 [2019-10-03 03:01:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:46,062 INFO L475 AbstractCegarLoop]: Abstraction has 3782 states and 5672 transitions. [2019-10-03 03:01:46,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5672 transitions. [2019-10-03 03:01:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:01:46,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:46,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:46,065 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:46,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:46,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1369199573, now seen corresponding path program 1 times [2019-10-03 03:01:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:46,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:46,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:46,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:46,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:46,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:46,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:46,200 INFO L87 Difference]: Start difference. First operand 3782 states and 5672 transitions. Second operand 9 states. [2019-10-03 03:01:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:47,165 INFO L93 Difference]: Finished difference Result 15977 states and 23903 transitions. [2019-10-03 03:01:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:01:47,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-03 03:01:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:47,201 INFO L225 Difference]: With dead ends: 15977 [2019-10-03 03:01:47,201 INFO L226 Difference]: Without dead ends: 15977 [2019-10-03 03:01:47,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:01:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15977 states. [2019-10-03 03:01:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15977 to 11695. [2019-10-03 03:01:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-10-03 03:01:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 17676 transitions. [2019-10-03 03:01:47,407 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 17676 transitions. Word has length 58 [2019-10-03 03:01:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:47,407 INFO L475 AbstractCegarLoop]: Abstraction has 11695 states and 17676 transitions. [2019-10-03 03:01:47,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 17676 transitions. [2019-10-03 03:01:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:01:47,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:47,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:47,411 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:47,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1177047496, now seen corresponding path program 1 times [2019-10-03 03:01:47,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:47,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:47,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:47,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:47,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:47,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:47,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:47,505 INFO L87 Difference]: Start difference. First operand 11695 states and 17676 transitions. Second operand 6 states. [2019-10-03 03:01:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:47,808 INFO L93 Difference]: Finished difference Result 16014 states and 24191 transitions. [2019-10-03 03:01:47,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:47,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-03 03:01:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:47,845 INFO L225 Difference]: With dead ends: 16014 [2019-10-03 03:01:47,846 INFO L226 Difference]: Without dead ends: 16014 [2019-10-03 03:01:47,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:01:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-10-03 03:01:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 9824. [2019-10-03 03:01:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9824 states. [2019-10-03 03:01:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9824 states to 9824 states and 14759 transitions. [2019-10-03 03:01:48,027 INFO L78 Accepts]: Start accepts. Automaton has 9824 states and 14759 transitions. Word has length 59 [2019-10-03 03:01:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:48,027 INFO L475 AbstractCegarLoop]: Abstraction has 9824 states and 14759 transitions. [2019-10-03 03:01:48,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9824 states and 14759 transitions. [2019-10-03 03:01:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:01:48,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:48,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:48,036 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash -90485979, now seen corresponding path program 1 times [2019-10-03 03:01:48,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:48,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:48,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:48,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:48,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:48,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:48,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:48,120 INFO L87 Difference]: Start difference. First operand 9824 states and 14759 transitions. Second operand 6 states. [2019-10-03 03:01:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:48,368 INFO L93 Difference]: Finished difference Result 11316 states and 16891 transitions. [2019-10-03 03:01:48,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:48,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-03 03:01:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:48,391 INFO L225 Difference]: With dead ends: 11316 [2019-10-03 03:01:48,391 INFO L226 Difference]: Without dead ends: 11316 [2019-10-03 03:01:48,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:01:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11316 states. [2019-10-03 03:01:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11316 to 7633. [2019-10-03 03:01:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-03 03:01:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11363 transitions. [2019-10-03 03:01:48,544 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11363 transitions. Word has length 59 [2019-10-03 03:01:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:48,544 INFO L475 AbstractCegarLoop]: Abstraction has 7633 states and 11363 transitions. [2019-10-03 03:01:48,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11363 transitions. [2019-10-03 03:01:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:01:48,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:48,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:48,547 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash -226647092, now seen corresponding path program 1 times [2019-10-03 03:01:48,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:48,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:48,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:48,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:48,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:48,619 INFO L87 Difference]: Start difference. First operand 7633 states and 11363 transitions. Second operand 5 states. [2019-10-03 03:01:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:48,892 INFO L93 Difference]: Finished difference Result 10894 states and 16000 transitions. [2019-10-03 03:01:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:48,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-03 03:01:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:48,914 INFO L225 Difference]: With dead ends: 10894 [2019-10-03 03:01:48,914 INFO L226 Difference]: Without dead ends: 10894 [2019-10-03 03:01:48,915 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10894 states. [2019-10-03 03:01:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10894 to 7633. [2019-10-03 03:01:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-03 03:01:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11259 transitions. [2019-10-03 03:01:49,055 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11259 transitions. Word has length 59 [2019-10-03 03:01:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:49,056 INFO L475 AbstractCegarLoop]: Abstraction has 7633 states and 11259 transitions. [2019-10-03 03:01:49,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11259 transitions. [2019-10-03 03:01:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:01:49,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:49,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:49,059 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 758768658, now seen corresponding path program 1 times [2019-10-03 03:01:49,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:49,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:49,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:49,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:49,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:49,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:49,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:49,174 INFO L87 Difference]: Start difference. First operand 7633 states and 11259 transitions. Second operand 5 states. [2019-10-03 03:01:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:49,347 INFO L93 Difference]: Finished difference Result 16178 states and 23931 transitions. [2019-10-03 03:01:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:49,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-03 03:01:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:49,379 INFO L225 Difference]: With dead ends: 16178 [2019-10-03 03:01:49,379 INFO L226 Difference]: Without dead ends: 16178 [2019-10-03 03:01:49,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16178 states. [2019-10-03 03:01:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16178 to 9877. [2019-10-03 03:01:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-10-03 03:01:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 14629 transitions. [2019-10-03 03:01:49,611 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 14629 transitions. Word has length 60 [2019-10-03 03:01:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:49,612 INFO L475 AbstractCegarLoop]: Abstraction has 9877 states and 14629 transitions. [2019-10-03 03:01:49,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 14629 transitions. [2019-10-03 03:01:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:01:49,620 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:49,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:49,624 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:49,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2035448048, now seen corresponding path program 1 times [2019-10-03 03:01:49,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:49,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:49,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:49,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:49,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:49,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:49,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:49,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:49,719 INFO L87 Difference]: Start difference. First operand 9877 states and 14629 transitions. Second operand 5 states. [2019-10-03 03:01:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:49,850 INFO L93 Difference]: Finished difference Result 17435 states and 25841 transitions. [2019-10-03 03:01:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:49,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-03 03:01:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:49,877 INFO L225 Difference]: With dead ends: 17435 [2019-10-03 03:01:49,878 INFO L226 Difference]: Without dead ends: 17435 [2019-10-03 03:01:49,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17435 states. [2019-10-03 03:01:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17435 to 11320. [2019-10-03 03:01:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11320 states. [2019-10-03 03:01:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 16793 transitions. [2019-10-03 03:01:50,122 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 16793 transitions. Word has length 60 [2019-10-03 03:01:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:50,123 INFO L475 AbstractCegarLoop]: Abstraction has 11320 states and 16793 transitions. [2019-10-03 03:01:50,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 16793 transitions. [2019-10-03 03:01:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 03:01:50,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:50,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:50,126 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2033763663, now seen corresponding path program 1 times [2019-10-03 03:01:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:50,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:50,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:01:50,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:50,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:01:50,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:01:50,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:50,225 INFO L87 Difference]: Start difference. First operand 11320 states and 16793 transitions. Second operand 7 states. [2019-10-03 03:01:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:50,858 INFO L93 Difference]: Finished difference Result 48732 states and 71649 transitions. [2019-10-03 03:01:50,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:01:50,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-10-03 03:01:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:50,920 INFO L225 Difference]: With dead ends: 48732 [2019-10-03 03:01:50,920 INFO L226 Difference]: Without dead ends: 48732 [2019-10-03 03:01:50,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:01:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48732 states. [2019-10-03 03:01:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48732 to 11416. [2019-10-03 03:01:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-10-03 03:01:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 16915 transitions. [2019-10-03 03:01:51,845 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 16915 transitions. Word has length 63 [2019-10-03 03:01:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:51,846 INFO L475 AbstractCegarLoop]: Abstraction has 11416 states and 16915 transitions. [2019-10-03 03:01:51,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:01:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 16915 transitions. [2019-10-03 03:01:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 03:01:51,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:51,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:51,850 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash -640902223, now seen corresponding path program 1 times [2019-10-03 03:01:51,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:51,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:51,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:51,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:51,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:51,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:51,900 INFO L87 Difference]: Start difference. First operand 11416 states and 16915 transitions. Second operand 3 states. [2019-10-03 03:01:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:51,966 INFO L93 Difference]: Finished difference Result 16920 states and 24533 transitions. [2019-10-03 03:01:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:51,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-03 03:01:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:51,990 INFO L225 Difference]: With dead ends: 16920 [2019-10-03 03:01:51,991 INFO L226 Difference]: Without dead ends: 16920 [2019-10-03 03:01:51,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16920 states. [2019-10-03 03:01:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16920 to 13802. [2019-10-03 03:01:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-10-03 03:01:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20148 transitions. [2019-10-03 03:01:52,197 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20148 transitions. Word has length 63 [2019-10-03 03:01:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:52,197 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20148 transitions. [2019-10-03 03:01:52,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20148 transitions. [2019-10-03 03:01:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 03:01:52,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:52,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:52,203 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 3874310, now seen corresponding path program 1 times [2019-10-03 03:01:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:52,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:52,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:52,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:52,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:52,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:52,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:52,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:52,478 INFO L87 Difference]: Start difference. First operand 13802 states and 20148 transitions. Second operand 10 states. [2019-10-03 03:01:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:54,265 INFO L93 Difference]: Finished difference Result 36117 states and 52149 transitions. [2019-10-03 03:01:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:01:54,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-10-03 03:01:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:54,311 INFO L225 Difference]: With dead ends: 36117 [2019-10-03 03:01:54,312 INFO L226 Difference]: Without dead ends: 36117 [2019-10-03 03:01:54,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:01:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36117 states. [2019-10-03 03:01:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36117 to 13802. [2019-10-03 03:01:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-10-03 03:01:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20142 transitions. [2019-10-03 03:01:54,609 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20142 transitions. Word has length 65 [2019-10-03 03:01:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:54,610 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20142 transitions. [2019-10-03 03:01:54,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20142 transitions. [2019-10-03 03:01:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 03:01:54,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:54,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:54,615 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1838871740, now seen corresponding path program 1 times [2019-10-03 03:01:54,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:54,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:54,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:54,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:54,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:54,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:54,806 INFO L87 Difference]: Start difference. First operand 13802 states and 20142 transitions. Second operand 10 states. [2019-10-03 03:01:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:56,475 INFO L93 Difference]: Finished difference Result 37871 states and 54803 transitions. [2019-10-03 03:01:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:01:56,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-10-03 03:01:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:56,515 INFO L225 Difference]: With dead ends: 37871 [2019-10-03 03:01:56,515 INFO L226 Difference]: Without dead ends: 37871 [2019-10-03 03:01:56,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:01:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37871 states. [2019-10-03 03:01:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37871 to 13590. [2019-10-03 03:01:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13590 states. [2019-10-03 03:01:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13590 states to 13590 states and 19823 transitions. [2019-10-03 03:01:56,758 INFO L78 Accepts]: Start accepts. Automaton has 13590 states and 19823 transitions. Word has length 65 [2019-10-03 03:01:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:56,758 INFO L475 AbstractCegarLoop]: Abstraction has 13590 states and 19823 transitions. [2019-10-03 03:01:56,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13590 states and 19823 transitions. [2019-10-03 03:01:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 03:01:56,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:56,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:56,763 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:56,764 INFO L82 PathProgramCache]: Analyzing trace with hash 434457602, now seen corresponding path program 1 times [2019-10-03 03:01:56,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:56,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:56,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:56,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:56,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:56,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:56,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:56,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:56,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:56,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:56,940 INFO L87 Difference]: Start difference. First operand 13590 states and 19823 transitions. Second operand 10 states. [2019-10-03 03:01:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:58,784 INFO L93 Difference]: Finished difference Result 35476 states and 51223 transitions. [2019-10-03 03:01:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:01:58,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-10-03 03:01:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:58,820 INFO L225 Difference]: With dead ends: 35476 [2019-10-03 03:01:58,820 INFO L226 Difference]: Without dead ends: 35476 [2019-10-03 03:01:58,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:01:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35476 states. [2019-10-03 03:01:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35476 to 13459. [2019-10-03 03:01:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-10-03 03:01:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 19616 transitions. [2019-10-03 03:01:59,030 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 19616 transitions. Word has length 65 [2019-10-03 03:01:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:59,030 INFO L475 AbstractCegarLoop]: Abstraction has 13459 states and 19616 transitions. [2019-10-03 03:01:59,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 19616 transitions. [2019-10-03 03:01:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:01:59,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:59,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:59,036 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:59,037 INFO L82 PathProgramCache]: Analyzing trace with hash 451101849, now seen corresponding path program 1 times [2019-10-03 03:01:59,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:59,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:59,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:59,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:59,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:59,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:59,083 INFO L87 Difference]: Start difference. First operand 13459 states and 19616 transitions. Second operand 3 states. [2019-10-03 03:01:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:59,128 INFO L93 Difference]: Finished difference Result 13443 states and 19291 transitions. [2019-10-03 03:01:59,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:59,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-03 03:01:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:59,143 INFO L225 Difference]: With dead ends: 13443 [2019-10-03 03:01:59,144 INFO L226 Difference]: Without dead ends: 13443 [2019-10-03 03:01:59,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13443 states. [2019-10-03 03:01:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13443 to 13441. [2019-10-03 03:01:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13441 states. [2019-10-03 03:01:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13441 states to 13441 states and 19290 transitions. [2019-10-03 03:01:59,288 INFO L78 Accepts]: Start accepts. Automaton has 13441 states and 19290 transitions. Word has length 66 [2019-10-03 03:01:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:59,288 INFO L475 AbstractCegarLoop]: Abstraction has 13441 states and 19290 transitions. [2019-10-03 03:01:59,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 13441 states and 19290 transitions. [2019-10-03 03:01:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:01:59,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:59,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:59,292 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1791143987, now seen corresponding path program 1 times [2019-10-03 03:01:59,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:59,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:59,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:59,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:59,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:59,351 INFO L87 Difference]: Start difference. First operand 13441 states and 19290 transitions. Second operand 3 states. [2019-10-03 03:01:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:59,402 INFO L93 Difference]: Finished difference Result 12081 states and 17024 transitions. [2019-10-03 03:01:59,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:59,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-03 03:01:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:59,415 INFO L225 Difference]: With dead ends: 12081 [2019-10-03 03:01:59,416 INFO L226 Difference]: Without dead ends: 12081 [2019-10-03 03:01:59,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12081 states. [2019-10-03 03:01:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12081 to 12079. [2019-10-03 03:01:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12079 states. [2019-10-03 03:01:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12079 states to 12079 states and 17023 transitions. [2019-10-03 03:01:59,538 INFO L78 Accepts]: Start accepts. Automaton has 12079 states and 17023 transitions. Word has length 66 [2019-10-03 03:01:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:59,538 INFO L475 AbstractCegarLoop]: Abstraction has 12079 states and 17023 transitions. [2019-10-03 03:01:59,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12079 states and 17023 transitions. [2019-10-03 03:01:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:01:59,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:59,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:59,542 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1997471743, now seen corresponding path program 1 times [2019-10-03 03:01:59,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:59,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:59,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:59,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:59,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:59,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:59,597 INFO L87 Difference]: Start difference. First operand 12079 states and 17023 transitions. Second operand 3 states. [2019-10-03 03:01:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:59,652 INFO L93 Difference]: Finished difference Result 10303 states and 14212 transitions. [2019-10-03 03:01:59,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:59,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-03 03:01:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:59,665 INFO L225 Difference]: With dead ends: 10303 [2019-10-03 03:01:59,666 INFO L226 Difference]: Without dead ends: 10303 [2019-10-03 03:01:59,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2019-10-03 03:01:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 10301. [2019-10-03 03:01:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-10-03 03:01:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 14211 transitions. [2019-10-03 03:01:59,802 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 14211 transitions. Word has length 66 [2019-10-03 03:01:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:59,803 INFO L475 AbstractCegarLoop]: Abstraction has 10301 states and 14211 transitions. [2019-10-03 03:01:59,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 14211 transitions. [2019-10-03 03:01:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:01:59,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:59,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:59,808 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1675019531, now seen corresponding path program 1 times [2019-10-03 03:01:59,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:59,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:59,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:59,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:59,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:59,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:59,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:59,863 INFO L87 Difference]: Start difference. First operand 10301 states and 14211 transitions. Second operand 3 states. [2019-10-03 03:02:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:00,055 INFO L93 Difference]: Finished difference Result 15154 states and 20941 transitions. [2019-10-03 03:02:00,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:00,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-03 03:02:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:00,078 INFO L225 Difference]: With dead ends: 15154 [2019-10-03 03:02:00,078 INFO L226 Difference]: Without dead ends: 15154 [2019-10-03 03:02:00,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15154 states. [2019-10-03 03:02:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15154 to 10108. [2019-10-03 03:02:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2019-10-03 03:02:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 13933 transitions. [2019-10-03 03:02:00,259 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 13933 transitions. Word has length 67 [2019-10-03 03:02:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:00,259 INFO L475 AbstractCegarLoop]: Abstraction has 10108 states and 13933 transitions. [2019-10-03 03:02:00,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 13933 transitions. [2019-10-03 03:02:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:02:00,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:00,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:00,264 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash 641499340, now seen corresponding path program 1 times [2019-10-03 03:02:00,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:00,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:00,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:00,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:00,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:00,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:00,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:00,330 INFO L87 Difference]: Start difference. First operand 10108 states and 13933 transitions. Second operand 3 states. [2019-10-03 03:02:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:00,430 INFO L93 Difference]: Finished difference Result 15010 states and 20708 transitions. [2019-10-03 03:02:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:00,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-03 03:02:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:00,453 INFO L225 Difference]: With dead ends: 15010 [2019-10-03 03:02:00,453 INFO L226 Difference]: Without dead ends: 15010 [2019-10-03 03:02:00,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15010 states. [2019-10-03 03:02:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15010 to 9964. [2019-10-03 03:02:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9964 states. [2019-10-03 03:02:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9964 states to 9964 states and 13716 transitions. [2019-10-03 03:02:00,603 INFO L78 Accepts]: Start accepts. Automaton has 9964 states and 13716 transitions. Word has length 67 [2019-10-03 03:02:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:00,604 INFO L475 AbstractCegarLoop]: Abstraction has 9964 states and 13716 transitions. [2019-10-03 03:02:00,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 9964 states and 13716 transitions. [2019-10-03 03:02:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:02:00,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:00,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:00,607 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:00,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1770759349, now seen corresponding path program 1 times [2019-10-03 03:02:00,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:00,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:00,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:00,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:00,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:01,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:01,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-03 03:02:01,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:01,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:02:01,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:02:01,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:02:01,360 INFO L87 Difference]: Start difference. First operand 9964 states and 13716 transitions. Second operand 23 states. [2019-10-03 03:02:01,552 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-10-03 03:02:02,376 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:02:02,558 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-03 03:02:02,882 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-10-03 03:02:03,154 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-10-03 03:02:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,499 INFO L93 Difference]: Finished difference Result 40432 states and 56149 transitions. [2019-10-03 03:02:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-03 03:02:07,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-10-03 03:02:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,540 INFO L225 Difference]: With dead ends: 40432 [2019-10-03 03:02:07,540 INFO L226 Difference]: Without dead ends: 40432 [2019-10-03 03:02:07,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=467, Invalid=2185, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 03:02:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40432 states. [2019-10-03 03:02:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40432 to 9976. [2019-10-03 03:02:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9976 states. [2019-10-03 03:02:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 13731 transitions. [2019-10-03 03:02:07,735 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 13731 transitions. Word has length 67 [2019-10-03 03:02:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,735 INFO L475 AbstractCegarLoop]: Abstraction has 9976 states and 13731 transitions. [2019-10-03 03:02:07,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:02:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 13731 transitions. [2019-10-03 03:02:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:02:07,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:07,739 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1042489363, now seen corresponding path program 1 times [2019-10-03 03:02:07,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:08,349 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-10-03 03:02:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:08,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:08,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-03 03:02:08,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:08,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:02:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:02:08,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:02:08,767 INFO L87 Difference]: Start difference. First operand 9976 states and 13731 transitions. Second operand 23 states. [2019-10-03 03:02:09,077 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-10-03 03:02:10,042 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-03 03:02:10,423 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-03 03:02:10,714 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:02:11,173 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-10-03 03:02:11,527 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-10-03 03:02:11,713 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:02:11,956 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:02:12,293 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-03 03:02:12,517 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-03 03:02:12,771 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:02:13,045 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-03 03:02:13,297 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-03 03:02:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:17,422 INFO L93 Difference]: Finished difference Result 45328 states and 62935 transitions. [2019-10-03 03:02:17,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:02:17,423 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-10-03 03:02:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:17,478 INFO L225 Difference]: With dead ends: 45328 [2019-10-03 03:02:17,479 INFO L226 Difference]: Without dead ends: 45328 [2019-10-03 03:02:17,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2019-10-03 03:02:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45328 states. [2019-10-03 03:02:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45328 to 9958. [2019-10-03 03:02:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9958 states. [2019-10-03 03:02:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 13705 transitions. [2019-10-03 03:02:17,684 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 13705 transitions. Word has length 67 [2019-10-03 03:02:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:17,684 INFO L475 AbstractCegarLoop]: Abstraction has 9958 states and 13705 transitions. [2019-10-03 03:02:17,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:02:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 13705 transitions. [2019-10-03 03:02:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:02:17,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:17,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:17,687 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2122497903, now seen corresponding path program 1 times [2019-10-03 03:02:17,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:17,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:17,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:17,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:17,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:18,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:18,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-03 03:02:18,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:18,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:02:18,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:02:18,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:02:18,335 INFO L87 Difference]: Start difference. First operand 9958 states and 13705 transitions. Second operand 23 states. [2019-10-03 03:02:18,541 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-10-03 03:02:19,452 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-03 03:02:19,645 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-03 03:02:20,014 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-03 03:02:20,261 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-10-03 03:02:21,023 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-03 03:02:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:25,199 INFO L93 Difference]: Finished difference Result 34057 states and 47296 transitions. [2019-10-03 03:02:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-03 03:02:25,200 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-10-03 03:02:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:25,232 INFO L225 Difference]: With dead ends: 34057 [2019-10-03 03:02:25,232 INFO L226 Difference]: Without dead ends: 34057 [2019-10-03 03:02:25,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=380, Invalid=1600, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 03:02:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34057 states. [2019-10-03 03:02:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34057 to 9940. [2019-10-03 03:02:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9940 states. [2019-10-03 03:02:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9940 states to 9940 states and 13679 transitions. [2019-10-03 03:02:25,399 INFO L78 Accepts]: Start accepts. Automaton has 9940 states and 13679 transitions. Word has length 67 [2019-10-03 03:02:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:25,400 INFO L475 AbstractCegarLoop]: Abstraction has 9940 states and 13679 transitions. [2019-10-03 03:02:25,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:02:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9940 states and 13679 transitions. [2019-10-03 03:02:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:02:25,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:25,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:25,403 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2129601635, now seen corresponding path program 1 times [2019-10-03 03:02:25,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:25,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:25,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:25,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:25,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:25,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 03:02:25,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:25,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:02:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:02:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:02:25,884 INFO L87 Difference]: Start difference. First operand 9940 states and 13679 transitions. Second operand 13 states. [2019-10-03 03:02:26,293 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-10-03 03:02:26,443 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-03 03:02:26,606 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-03 03:02:26,763 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-03 03:02:27,143 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-03 03:02:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:27,751 INFO L93 Difference]: Finished difference Result 27573 states and 38146 transitions. [2019-10-03 03:02:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:02:27,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-10-03 03:02:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:27,779 INFO L225 Difference]: With dead ends: 27573 [2019-10-03 03:02:27,780 INFO L226 Difference]: Without dead ends: 27573 [2019-10-03 03:02:27,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:02:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27573 states. [2019-10-03 03:02:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27573 to 9856. [2019-10-03 03:02:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9856 states. [2019-10-03 03:02:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9856 states to 9856 states and 13568 transitions. [2019-10-03 03:02:27,934 INFO L78 Accepts]: Start accepts. Automaton has 9856 states and 13568 transitions. Word has length 68 [2019-10-03 03:02:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:27,934 INFO L475 AbstractCegarLoop]: Abstraction has 9856 states and 13568 transitions. [2019-10-03 03:02:27,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:02:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 9856 states and 13568 transitions. [2019-10-03 03:02:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:02:27,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:27,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:27,937 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:27,937 INFO L82 PathProgramCache]: Analyzing trace with hash 122708509, now seen corresponding path program 1 times [2019-10-03 03:02:27,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:27,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:27,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:28,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:28,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 03:02:28,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:28,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:02:28,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:02:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:28,763 INFO L87 Difference]: Start difference. First operand 9856 states and 13568 transitions. Second operand 18 states. [2019-10-03 03:02:29,369 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-10-03 03:02:29,520 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-10-03 03:02:29,908 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:02:30,278 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-03 03:02:30,533 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-03 03:02:30,883 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-03 03:02:31,094 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-03 03:02:31,367 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-03 03:02:31,692 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-03 03:02:31,895 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-10-03 03:02:32,141 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-03 03:02:32,882 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-03 03:02:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:35,577 INFO L93 Difference]: Finished difference Result 44434 states and 61628 transitions. [2019-10-03 03:02:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-03 03:02:35,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-10-03 03:02:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:35,624 INFO L225 Difference]: With dead ends: 44434 [2019-10-03 03:02:35,625 INFO L226 Difference]: Without dead ends: 44434 [2019-10-03 03:02:35,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 03:02:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44434 states. [2019-10-03 03:02:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44434 to 9819. [2019-10-03 03:02:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-10-03 03:02:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 13516 transitions. [2019-10-03 03:02:35,846 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 13516 transitions. Word has length 68 [2019-10-03 03:02:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:35,846 INFO L475 AbstractCegarLoop]: Abstraction has 9819 states and 13516 transitions. [2019-10-03 03:02:35,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:02:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 13516 transitions. [2019-10-03 03:02:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 03:02:35,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:35,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:35,848 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash 780074214, now seen corresponding path program 1 times [2019-10-03 03:02:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:35,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:35,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:35,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:35,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:35,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:35,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:35,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:35,915 INFO L87 Difference]: Start difference. First operand 9819 states and 13516 transitions. Second operand 5 states. [2019-10-03 03:02:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:35,988 INFO L93 Difference]: Finished difference Result 9445 states and 13018 transitions. [2019-10-03 03:02:35,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:35,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-10-03 03:02:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:35,999 INFO L225 Difference]: With dead ends: 9445 [2019-10-03 03:02:36,000 INFO L226 Difference]: Without dead ends: 9445 [2019-10-03 03:02:36,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9445 states. [2019-10-03 03:02:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9445 to 9441. [2019-10-03 03:02:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-10-03 03:02:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 13016 transitions. [2019-10-03 03:02:36,112 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 13016 transitions. Word has length 69 [2019-10-03 03:02:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:36,113 INFO L475 AbstractCegarLoop]: Abstraction has 9441 states and 13016 transitions. [2019-10-03 03:02:36,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 13016 transitions. [2019-10-03 03:02:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 03:02:36,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:36,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:36,117 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash 210202670, now seen corresponding path program 1 times [2019-10-03 03:02:36,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:36,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:36,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:36,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:36,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:36,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:36,224 INFO L87 Difference]: Start difference. First operand 9441 states and 13016 transitions. Second operand 6 states. [2019-10-03 03:02:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:36,350 INFO L93 Difference]: Finished difference Result 17928 states and 24219 transitions. [2019-10-03 03:02:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:36,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-03 03:02:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:36,372 INFO L225 Difference]: With dead ends: 17928 [2019-10-03 03:02:36,372 INFO L226 Difference]: Without dead ends: 17928 [2019-10-03 03:02:36,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17928 states. [2019-10-03 03:02:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17928 to 9756. [2019-10-03 03:02:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9756 states. [2019-10-03 03:02:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9756 states to 9756 states and 13246 transitions. [2019-10-03 03:02:36,530 INFO L78 Accepts]: Start accepts. Automaton has 9756 states and 13246 transitions. Word has length 72 [2019-10-03 03:02:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:36,531 INFO L475 AbstractCegarLoop]: Abstraction has 9756 states and 13246 transitions. [2019-10-03 03:02:36,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9756 states and 13246 transitions. [2019-10-03 03:02:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-03 03:02:36,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:36,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:36,535 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -61361821, now seen corresponding path program 1 times [2019-10-03 03:02:36,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:36,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:36,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:36,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:36,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:36,585 INFO L87 Difference]: Start difference. First operand 9756 states and 13246 transitions. Second operand 3 states. [2019-10-03 03:02:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:36,655 INFO L93 Difference]: Finished difference Result 17157 states and 22869 transitions. [2019-10-03 03:02:36,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:36,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-03 03:02:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:36,676 INFO L225 Difference]: With dead ends: 17157 [2019-10-03 03:02:36,677 INFO L226 Difference]: Without dead ends: 17157 [2019-10-03 03:02:36,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17157 states. [2019-10-03 03:02:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17157 to 16945. [2019-10-03 03:02:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16945 states. [2019-10-03 03:02:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 22658 transitions. [2019-10-03 03:02:36,878 INFO L78 Accepts]: Start accepts. Automaton has 16945 states and 22658 transitions. Word has length 73 [2019-10-03 03:02:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:36,879 INFO L475 AbstractCegarLoop]: Abstraction has 16945 states and 22658 transitions. [2019-10-03 03:02:36,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 16945 states and 22658 transitions. [2019-10-03 03:02:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 03:02:36,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:36,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:36,883 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:36,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:36,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1062164750, now seen corresponding path program 1 times [2019-10-03 03:02:36,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:36,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:36,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:36,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:36,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:36,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:36,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:36,926 INFO L87 Difference]: Start difference. First operand 16945 states and 22658 transitions. Second operand 3 states. [2019-10-03 03:02:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:37,018 INFO L93 Difference]: Finished difference Result 31609 states and 41549 transitions. [2019-10-03 03:02:37,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:37,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-03 03:02:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:37,058 INFO L225 Difference]: With dead ends: 31609 [2019-10-03 03:02:37,058 INFO L226 Difference]: Without dead ends: 31609 [2019-10-03 03:02:37,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31609 states. [2019-10-03 03:02:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31609 to 29323. [2019-10-03 03:02:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29323 states. [2019-10-03 03:02:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29323 states to 29323 states and 38792 transitions. [2019-10-03 03:02:37,341 INFO L78 Accepts]: Start accepts. Automaton has 29323 states and 38792 transitions. Word has length 75 [2019-10-03 03:02:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:37,341 INFO L475 AbstractCegarLoop]: Abstraction has 29323 states and 38792 transitions. [2019-10-03 03:02:37,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 29323 states and 38792 transitions. [2019-10-03 03:02:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 03:02:37,344 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:37,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:37,345 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:37,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:37,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1917451455, now seen corresponding path program 1 times [2019-10-03 03:02:37,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:37,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:37,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:37,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:37,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:37,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:37,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:37,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:37,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:37,398 INFO L87 Difference]: Start difference. First operand 29323 states and 38792 transitions. Second operand 3 states. [2019-10-03 03:02:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:37,544 INFO L93 Difference]: Finished difference Result 45553 states and 59133 transitions. [2019-10-03 03:02:37,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:37,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-03 03:02:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:37,596 INFO L225 Difference]: With dead ends: 45553 [2019-10-03 03:02:37,596 INFO L226 Difference]: Without dead ends: 45553 [2019-10-03 03:02:37,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45553 states. [2019-10-03 03:02:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45553 to 41615. [2019-10-03 03:02:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41615 states. [2019-10-03 03:02:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41615 states to 41615 states and 54612 transitions. [2019-10-03 03:02:37,971 INFO L78 Accepts]: Start accepts. Automaton has 41615 states and 54612 transitions. Word has length 76 [2019-10-03 03:02:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:37,971 INFO L475 AbstractCegarLoop]: Abstraction has 41615 states and 54612 transitions. [2019-10-03 03:02:37,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 41615 states and 54612 transitions. [2019-10-03 03:02:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 03:02:37,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:37,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:37,974 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:37,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2051052788, now seen corresponding path program 1 times [2019-10-03 03:02:37,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:37,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:37,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:38,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:38,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:38,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:38,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:38,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:38,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:38,026 INFO L87 Difference]: Start difference. First operand 41615 states and 54612 transitions. Second operand 5 states. [2019-10-03 03:02:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:38,363 INFO L93 Difference]: Finished difference Result 66978 states and 83861 transitions. [2019-10-03 03:02:38,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:38,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-03 03:02:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:38,433 INFO L225 Difference]: With dead ends: 66978 [2019-10-03 03:02:38,433 INFO L226 Difference]: Without dead ends: 66978 [2019-10-03 03:02:38,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66978 states. [2019-10-03 03:02:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66978 to 38553. [2019-10-03 03:02:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38553 states. [2019-10-03 03:02:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38553 states to 38553 states and 49077 transitions. [2019-10-03 03:02:39,794 INFO L78 Accepts]: Start accepts. Automaton has 38553 states and 49077 transitions. Word has length 82 [2019-10-03 03:02:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:39,794 INFO L475 AbstractCegarLoop]: Abstraction has 38553 states and 49077 transitions. [2019-10-03 03:02:39,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 38553 states and 49077 transitions. [2019-10-03 03:02:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:02:39,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:39,798 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:39,798 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:39,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1781698448, now seen corresponding path program 1 times [2019-10-03 03:02:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:39,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:39,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 03:02:39,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:39,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:39,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:39,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:39,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:39,843 INFO L87 Difference]: Start difference. First operand 38553 states and 49077 transitions. Second operand 3 states. [2019-10-03 03:02:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:40,001 INFO L93 Difference]: Finished difference Result 72288 states and 89703 transitions. [2019-10-03 03:02:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:40,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-03 03:02:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:40,075 INFO L225 Difference]: With dead ends: 72288 [2019-10-03 03:02:40,076 INFO L226 Difference]: Without dead ends: 72288 [2019-10-03 03:02:40,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72288 states. [2019-10-03 03:02:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72288 to 62546. [2019-10-03 03:02:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62546 states. [2019-10-03 03:02:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62546 states to 62546 states and 78768 transitions. [2019-10-03 03:02:40,618 INFO L78 Accepts]: Start accepts. Automaton has 62546 states and 78768 transitions. Word has length 93 [2019-10-03 03:02:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:40,618 INFO L475 AbstractCegarLoop]: Abstraction has 62546 states and 78768 transitions. [2019-10-03 03:02:40,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 62546 states and 78768 transitions. [2019-10-03 03:02:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:02:40,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:40,623 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:40,623 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1356554498, now seen corresponding path program 1 times [2019-10-03 03:02:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:40,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:40,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:40,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:02:40,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:40,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:02:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:02:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:02:40,822 INFO L87 Difference]: Start difference. First operand 62546 states and 78768 transitions. Second operand 10 states. [2019-10-03 03:02:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:43,492 INFO L93 Difference]: Finished difference Result 217132 states and 271277 transitions. [2019-10-03 03:02:43,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:02:43,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-10-03 03:02:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:43,754 INFO L225 Difference]: With dead ends: 217132 [2019-10-03 03:02:43,754 INFO L226 Difference]: Without dead ends: 217132 [2019-10-03 03:02:43,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:02:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217132 states. [2019-10-03 03:02:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217132 to 83812. [2019-10-03 03:02:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83812 states. [2019-10-03 03:02:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83812 states to 83812 states and 105544 transitions. [2019-10-03 03:02:47,622 INFO L78 Accepts]: Start accepts. Automaton has 83812 states and 105544 transitions. Word has length 96 [2019-10-03 03:02:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:47,622 INFO L475 AbstractCegarLoop]: Abstraction has 83812 states and 105544 transitions. [2019-10-03 03:02:47,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:02:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 83812 states and 105544 transitions. [2019-10-03 03:02:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:02:47,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:47,627 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:47,628 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:47,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1244823914, now seen corresponding path program 1 times [2019-10-03 03:02:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:47,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:47,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:47,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:47,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:47,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-10-03 03:02:47,819 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [147], [150], [153], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [298], [303], [316], [318], [331], [339], [358], [369], [371], [374], [377], [380], [382], [384], [426], [439], [447], [459], [473], [485], [493], [509], [535], [556], [557], [561], [562], [563] [2019-10-03 03:02:47,858 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:47,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:47,958 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:48,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:48,386 INFO L272 AbstractInterpreter]: Visited 90 different actions 325 times. Merged at 33 different actions 211 times. Widened at 12 different actions 30 times. Performed 1131 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 114 variables. [2019-10-03 03:02:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:48,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:48,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:48,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:48,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:48,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:48,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:02:48,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:49,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:49,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:49,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-10-03 03:02:49,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:49,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:49,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:02:49,752 INFO L87 Difference]: Start difference. First operand 83812 states and 105544 transitions. Second operand 19 states. [2019-10-03 03:02:50,036 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:02:50,182 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:02:50,426 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:02:51,786 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-10-03 03:02:53,081 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-03 03:02:53,811 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-03 03:02:54,486 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-03 03:02:55,009 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-10-03 03:02:56,547 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-03 03:02:56,940 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-03 03:02:57,782 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-03 03:02:58,354 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-03 03:02:59,517 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:02:59,809 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-03 03:03:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:00,152 INFO L93 Difference]: Finished difference Result 216951 states and 269206 transitions. [2019-10-03 03:03:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-03 03:03:00,152 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-10-03 03:03:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:00,633 INFO L225 Difference]: With dead ends: 216951 [2019-10-03 03:03:00,634 INFO L226 Difference]: Without dead ends: 216951 [2019-10-03 03:03:00,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 170 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1135, Invalid=3695, Unknown=0, NotChecked=0, Total=4830 [2019-10-03 03:03:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216951 states. [2019-10-03 03:03:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216951 to 115694. [2019-10-03 03:03:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115694 states. [2019-10-03 03:03:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115694 states to 115694 states and 145728 transitions. [2019-10-03 03:03:04,392 INFO L78 Accepts]: Start accepts. Automaton has 115694 states and 145728 transitions. Word has length 96 [2019-10-03 03:03:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:04,393 INFO L475 AbstractCegarLoop]: Abstraction has 115694 states and 145728 transitions. [2019-10-03 03:03:04,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:03:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 115694 states and 145728 transitions. [2019-10-03 03:03:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:03:04,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:04,412 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:04,413 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 942692355, now seen corresponding path program 1 times [2019-10-03 03:03:04,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:04,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:04,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:04,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:04,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-10-03 03:03:04,521 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [298], [303], [316], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [426], [439], [447], [461], [473], [483], [514], [530], [535], [556], [557], [561], [562], [563] [2019-10-03 03:03:04,530 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:04,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:04,556 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:04,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:04,752 INFO L272 AbstractInterpreter]: Visited 91 different actions 362 times. Merged at 34 different actions 244 times. Widened at 10 different actions 32 times. Performed 1230 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1230 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 8 different actions. Largest state had 114 variables. [2019-10-03 03:03:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:04,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:04,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:04,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:04,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:04,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-03 03:03:04,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:05,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:05,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:05,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2019-10-03 03:03:05,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:05,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:03:05,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:03:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:03:05,301 INFO L87 Difference]: Start difference. First operand 115694 states and 145728 transitions. Second operand 11 states. [2019-10-03 03:03:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:05,994 INFO L93 Difference]: Finished difference Result 165161 states and 206736 transitions. [2019-10-03 03:03:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:03:05,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-10-03 03:03:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:06,260 INFO L225 Difference]: With dead ends: 165161 [2019-10-03 03:03:06,260 INFO L226 Difference]: Without dead ends: 165161 [2019-10-03 03:03:06,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:03:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165161 states. [2019-10-03 03:03:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165161 to 152334. [2019-10-03 03:03:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152334 states. [2019-10-03 03:03:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152334 states to 152334 states and 191676 transitions. [2019-10-03 03:03:10,316 INFO L78 Accepts]: Start accepts. Automaton has 152334 states and 191676 transitions. Word has length 97 [2019-10-03 03:03:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:10,317 INFO L475 AbstractCegarLoop]: Abstraction has 152334 states and 191676 transitions. [2019-10-03 03:03:10,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:03:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 152334 states and 191676 transitions. [2019-10-03 03:03:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 03:03:10,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:10,336 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:10,336 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1161715826, now seen corresponding path program 1 times [2019-10-03 03:03:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:10,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:10,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:10,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:10,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-10-03 03:03:10,408 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [275], [278], [281], [284], [286], [288], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [426], [429], [432], [435], [437], [439], [461], [471], [476], [479], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:03:10,412 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:10,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:10,425 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:10,494 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:03:10,494 INFO L272 AbstractInterpreter]: Visited 97 different actions 164 times. Merged at 28 different actions 58 times. Never widened. Performed 640 root evaluator evaluations with a maximum evaluation depth of 5. Performed 640 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 117 variables. [2019-10-03 03:03:10,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:10,494 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:03:10,864 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 82.31% of their original sizes. [2019-10-03 03:03:10,864 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:03:15,146 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-10-03 03:03:15,146 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:03:15,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:15,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-10-03 03:03:15,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:15,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-03 03:03:15,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-03 03:03:15,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=4241, Unknown=0, NotChecked=0, Total=4556 [2019-10-03 03:03:15,150 INFO L87 Difference]: Start difference. First operand 152334 states and 191676 transitions. Second operand 68 states. [2019-10-03 03:04:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:00,167 INFO L93 Difference]: Finished difference Result 198565 states and 249367 transitions. [2019-10-03 03:04:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-10-03 03:04:00,168 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 107 [2019-10-03 03:04:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:00,375 INFO L225 Difference]: With dead ends: 198565 [2019-10-03 03:04:00,375 INFO L226 Difference]: Without dead ends: 198565 [2019-10-03 03:04:00,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6652 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1566, Invalid=20784, Unknown=0, NotChecked=0, Total=22350 [2019-10-03 03:04:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198565 states. [2019-10-03 03:04:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198565 to 164336. [2019-10-03 03:04:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164336 states. [2019-10-03 03:04:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164336 states to 164336 states and 206456 transitions. [2019-10-03 03:04:01,887 INFO L78 Accepts]: Start accepts. Automaton has 164336 states and 206456 transitions. Word has length 107 [2019-10-03 03:04:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:01,887 INFO L475 AbstractCegarLoop]: Abstraction has 164336 states and 206456 transitions. [2019-10-03 03:04:01,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-03 03:04:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 164336 states and 206456 transitions. [2019-10-03 03:04:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 03:04:01,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:01,902 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:01,902 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1309307435, now seen corresponding path program 1 times [2019-10-03 03:04:01,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:01,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:01,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:01,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:01,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:01,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:01,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:01,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-10-03 03:04:01,968 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [426], [429], [432], [435], [437], [439], [461], [471], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:04:01,971 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:01,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:01,982 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:02,037 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:04:02,037 INFO L272 AbstractInterpreter]: Visited 98 different actions 189 times. Merged at 30 different actions 80 times. Never widened. Performed 684 root evaluator evaluations with a maximum evaluation depth of 5. Performed 684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 116 variables. [2019-10-03 03:04:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:02,038 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:04:02,186 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 82.34% of their original sizes. [2019-10-03 03:04:02,186 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:04:06,901 INFO L420 sIntCurrentIteration]: We unified 107 AI predicates to 107 [2019-10-03 03:04:06,901 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:04:06,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:04:06,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2019-10-03 03:04:06,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:06,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-03 03:04:06,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-03 03:04:06,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3952, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 03:04:06,904 INFO L87 Difference]: Start difference. First operand 164336 states and 206456 transitions. Second operand 66 states. [2019-10-03 03:05:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:39,156 INFO L93 Difference]: Finished difference Result 226232 states and 282889 transitions. [2019-10-03 03:05:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 351 states. [2019-10-03 03:05:39,156 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 108 [2019-10-03 03:05:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:39,395 INFO L225 Difference]: With dead ends: 226232 [2019-10-03 03:05:39,395 INFO L226 Difference]: Without dead ends: 226232 [2019-10-03 03:05:39,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62696 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=13252, Invalid=140020, Unknown=0, NotChecked=0, Total=153272 [2019-10-03 03:05:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226232 states. [2019-10-03 03:05:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226232 to 178306. [2019-10-03 03:05:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178306 states. [2019-10-03 03:05:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178306 states to 178306 states and 223481 transitions. [2019-10-03 03:05:41,260 INFO L78 Accepts]: Start accepts. Automaton has 178306 states and 223481 transitions. Word has length 108 [2019-10-03 03:05:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:41,260 INFO L475 AbstractCegarLoop]: Abstraction has 178306 states and 223481 transitions. [2019-10-03 03:05:41,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-03 03:05:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 178306 states and 223481 transitions. [2019-10-03 03:05:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 03:05:41,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:41,274 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:41,274 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 942233825, now seen corresponding path program 1 times [2019-10-03 03:05:41,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:41,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:41,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 03:05:41,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:41,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:05:41,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:41,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:05:41,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:05:41,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:05:41,328 INFO L87 Difference]: Start difference. First operand 178306 states and 223481 transitions. Second operand 4 states. [2019-10-03 03:05:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:41,910 INFO L93 Difference]: Finished difference Result 209522 states and 261692 transitions. [2019-10-03 03:05:41,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:05:41,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-03 03:05:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:42,140 INFO L225 Difference]: With dead ends: 209522 [2019-10-03 03:05:42,140 INFO L226 Difference]: Without dead ends: 209522 [2019-10-03 03:05:42,141 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:05:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209522 states. [2019-10-03 03:05:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209522 to 175281. [2019-10-03 03:05:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175281 states. [2019-10-03 03:05:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175281 states to 175281 states and 219707 transitions. [2019-10-03 03:05:44,694 INFO L78 Accepts]: Start accepts. Automaton has 175281 states and 219707 transitions. Word has length 108 [2019-10-03 03:05:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:44,694 INFO L475 AbstractCegarLoop]: Abstraction has 175281 states and 219707 transitions. [2019-10-03 03:05:44,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:05:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 175281 states and 219707 transitions. [2019-10-03 03:05:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 03:05:44,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:44,705 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:44,706 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2086902906, now seen corresponding path program 1 times [2019-10-03 03:05:44,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:44,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:44,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:44,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:44,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:05:44,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:44,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:05:44,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:05:44,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:05:44,767 INFO L87 Difference]: Start difference. First operand 175281 states and 219707 transitions. Second operand 5 states. [2019-10-03 03:05:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:45,418 INFO L93 Difference]: Finished difference Result 203368 states and 249319 transitions. [2019-10-03 03:05:45,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:05:45,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-03 03:05:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:45,623 INFO L225 Difference]: With dead ends: 203368 [2019-10-03 03:05:45,623 INFO L226 Difference]: Without dead ends: 203368 [2019-10-03 03:05:45,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:05:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203368 states. [2019-10-03 03:05:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203368 to 163654. [2019-10-03 03:05:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163654 states. [2019-10-03 03:05:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163654 states to 163654 states and 201740 transitions. [2019-10-03 03:05:50,468 INFO L78 Accepts]: Start accepts. Automaton has 163654 states and 201740 transitions. Word has length 108 [2019-10-03 03:05:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:50,468 INFO L475 AbstractCegarLoop]: Abstraction has 163654 states and 201740 transitions. [2019-10-03 03:05:50,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:05:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 163654 states and 201740 transitions. [2019-10-03 03:05:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:05:50,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:50,482 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:50,482 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1295314631, now seen corresponding path program 1 times [2019-10-03 03:05:50,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:50,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:50,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:50,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:50,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:05:50,539 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-10-03 03:05:50,539 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [426], [429], [432], [435], [437], [439], [461], [471], [476], [481], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:05:50,541 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:05:50,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:05:50,551 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:05:50,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:05:50,603 INFO L272 AbstractInterpreter]: Visited 99 different actions 190 times. Merged at 30 different actions 80 times. Never widened. Performed 684 root evaluator evaluations with a maximum evaluation depth of 5. Performed 684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 116 variables. [2019-10-03 03:05:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:50,603 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:05:50,720 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 81.9% of their original sizes. [2019-10-03 03:05:50,721 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:05:54,919 INFO L420 sIntCurrentIteration]: We unified 108 AI predicates to 108 [2019-10-03 03:05:54,919 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:05:54,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:05:54,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2019-10-03 03:05:54,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:54,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-03 03:05:54,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-03 03:05:54,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3939, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 03:05:54,921 INFO L87 Difference]: Start difference. First operand 163654 states and 201740 transitions. Second operand 66 states. [2019-10-03 03:07:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:02,278 INFO L93 Difference]: Finished difference Result 191373 states and 235305 transitions. [2019-10-03 03:07:02,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2019-10-03 03:07:02,278 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 109 [2019-10-03 03:07:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:02,541 INFO L225 Difference]: With dead ends: 191373 [2019-10-03 03:07:02,541 INFO L226 Difference]: Without dead ends: 191373 [2019-10-03 03:07:02,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32388 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=7638, Invalid=75018, Unknown=0, NotChecked=0, Total=82656 [2019-10-03 03:07:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191373 states. [2019-10-03 03:07:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191373 to 153659. [2019-10-03 03:07:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153659 states. [2019-10-03 03:07:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153659 states to 153659 states and 189517 transitions. [2019-10-03 03:07:07,017 INFO L78 Accepts]: Start accepts. Automaton has 153659 states and 189517 transitions. Word has length 109 [2019-10-03 03:07:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:07,017 INFO L475 AbstractCegarLoop]: Abstraction has 153659 states and 189517 transitions. [2019-10-03 03:07:07,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-03 03:07:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 153659 states and 189517 transitions. [2019-10-03 03:07:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 03:07:07,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:07,026 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:07,026 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2118332918, now seen corresponding path program 1 times [2019-10-03 03:07:07,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:07,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:07,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:07,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:07,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:07,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:07:07,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:07,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:07:07,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:07:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:07:07,088 INFO L87 Difference]: Start difference. First operand 153659 states and 189517 transitions. Second operand 3 states. [2019-10-03 03:07:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:07,395 INFO L93 Difference]: Finished difference Result 108259 states and 130059 transitions. [2019-10-03 03:07:07,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:07:07,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-10-03 03:07:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:07,535 INFO L225 Difference]: With dead ends: 108259 [2019-10-03 03:07:07,535 INFO L226 Difference]: Without dead ends: 108259 [2019-10-03 03:07:07,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:07:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108259 states. [2019-10-03 03:07:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108259 to 108242. [2019-10-03 03:07:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108242 states. [2019-10-03 03:07:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108242 states to 108242 states and 130043 transitions. [2019-10-03 03:07:09,133 INFO L78 Accepts]: Start accepts. Automaton has 108242 states and 130043 transitions. Word has length 110 [2019-10-03 03:07:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:09,133 INFO L475 AbstractCegarLoop]: Abstraction has 108242 states and 130043 transitions. [2019-10-03 03:07:09,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:07:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 108242 states and 130043 transitions. [2019-10-03 03:07:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:07:09,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:09,140 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:09,140 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1115041137, now seen corresponding path program 1 times [2019-10-03 03:07:09,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:09,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:09,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:09,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:09,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:09,410 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-10-03 03:07:09,410 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [426], [429], [432], [435], [437], [439], [461], [471], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:07:09,413 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:09,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:09,422 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:09,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:09,557 INFO L272 AbstractInterpreter]: Visited 106 different actions 450 times. Merged at 41 different actions 313 times. Widened at 15 different actions 49 times. Performed 1444 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 12 different actions. Largest state had 117 variables. [2019-10-03 03:07:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:09,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:09,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:09,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:07:09,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:09,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:09,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:07:09,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:09,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:09,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:09,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:10,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:10,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:10,611 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:07:10,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-10-03 03:07:10,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:10,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:07:10,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:07:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:07:10,613 INFO L87 Difference]: Start difference. First operand 108242 states and 130043 transitions. Second operand 12 states. [2019-10-03 03:07:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:12,290 INFO L93 Difference]: Finished difference Result 127321 states and 152185 transitions. [2019-10-03 03:07:12,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:07:12,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-10-03 03:07:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:12,440 INFO L225 Difference]: With dead ends: 127321 [2019-10-03 03:07:12,440 INFO L226 Difference]: Without dead ends: 127321 [2019-10-03 03:07:12,441 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=321, Invalid=1935, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 03:07:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127321 states. [2019-10-03 03:07:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127321 to 120577. [2019-10-03 03:07:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120577 states. [2019-10-03 03:07:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120577 states to 120577 states and 144683 transitions. [2019-10-03 03:07:14,181 INFO L78 Accepts]: Start accepts. Automaton has 120577 states and 144683 transitions. Word has length 111 [2019-10-03 03:07:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:14,182 INFO L475 AbstractCegarLoop]: Abstraction has 120577 states and 144683 transitions. [2019-10-03 03:07:14,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:07:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120577 states and 144683 transitions. [2019-10-03 03:07:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:07:14,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:14,189 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:14,189 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash 392272897, now seen corresponding path program 1 times [2019-10-03 03:07:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:14,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:14,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:14,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:14,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:14,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-10-03 03:07:14,496 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [426], [429], [432], [435], [437], [439], [461], [471], [476], [479], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:07:14,500 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:14,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:14,505 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:14,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:14,664 INFO L272 AbstractInterpreter]: Visited 106 different actions 422 times. Merged at 40 different actions 288 times. Widened at 13 different actions 39 times. Performed 1364 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1364 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 12 different actions. Largest state had 117 variables. [2019-10-03 03:07:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:14,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:14,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:14,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:07:14,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:14,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:14,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 03:07:14,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:15,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:07:15,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [12] total 31 [2019-10-03 03:07:15,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:15,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:07:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:07:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:07:15,612 INFO L87 Difference]: Start difference. First operand 120577 states and 144683 transitions. Second operand 12 states. [2019-10-03 03:07:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:17,369 INFO L93 Difference]: Finished difference Result 130527 states and 155469 transitions. [2019-10-03 03:07:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:07:17,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-10-03 03:07:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:17,495 INFO L225 Difference]: With dead ends: 130527 [2019-10-03 03:07:17,495 INFO L226 Difference]: Without dead ends: 130527 [2019-10-03 03:07:17,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=329, Invalid=1833, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 03:07:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130527 states. [2019-10-03 03:07:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130527 to 118974. [2019-10-03 03:07:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118974 states. [2019-10-03 03:07:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118974 states to 118974 states and 142633 transitions. [2019-10-03 03:07:19,278 INFO L78 Accepts]: Start accepts. Automaton has 118974 states and 142633 transitions. Word has length 111 [2019-10-03 03:07:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:19,278 INFO L475 AbstractCegarLoop]: Abstraction has 118974 states and 142633 transitions. [2019-10-03 03:07:19,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:07:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 118974 states and 142633 transitions. [2019-10-03 03:07:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:07:19,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:19,284 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:19,284 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1153231788, now seen corresponding path program 1 times [2019-10-03 03:07:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:19,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:19,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:07:19,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:19,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:07:19,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:19,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:07:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:07:19,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:07:19,343 INFO L87 Difference]: Start difference. First operand 118974 states and 142633 transitions. Second operand 4 states. [2019-10-03 03:07:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:19,775 INFO L93 Difference]: Finished difference Result 132037 states and 157895 transitions. [2019-10-03 03:07:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:07:19,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-03 03:07:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:19,896 INFO L225 Difference]: With dead ends: 132037 [2019-10-03 03:07:19,896 INFO L226 Difference]: Without dead ends: 132037 [2019-10-03 03:07:19,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:07:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132037 states. [2019-10-03 03:07:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132037 to 117959. [2019-10-03 03:07:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117959 states. [2019-10-03 03:07:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117959 states to 117959 states and 141331 transitions. [2019-10-03 03:07:21,844 INFO L78 Accepts]: Start accepts. Automaton has 117959 states and 141331 transitions. Word has length 111 [2019-10-03 03:07:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:21,844 INFO L475 AbstractCegarLoop]: Abstraction has 117959 states and 141331 transitions. [2019-10-03 03:07:21,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:07:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 117959 states and 141331 transitions. [2019-10-03 03:07:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:07:21,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:21,849 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:21,849 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -516669873, now seen corresponding path program 1 times [2019-10-03 03:07:21,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:21,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:22,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:22,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:22,253 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-10-03 03:07:22,253 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [145], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [316], [318], [331], [339], [342], [345], [348], [350], [360], [363], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [459], [485], [493], [509], [556], [557], [561], [562], [563] [2019-10-03 03:07:22,255 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:22,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:22,264 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:22,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:22,416 INFO L272 AbstractInterpreter]: Visited 106 different actions 392 times. Merged at 41 different actions 261 times. Widened at 13 different actions 30 times. Performed 1306 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1306 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 9 different actions. Largest state had 117 variables. [2019-10-03 03:07:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:22,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:22,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:22,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:07:22,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:22,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:22,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:07:22,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:22,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:22,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:22,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:22,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:23,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:23,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:23,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:07:23,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2019-10-03 03:07:23,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:07:23,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 03:07:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 03:07:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 03:07:23,518 INFO L87 Difference]: Start difference. First operand 117959 states and 141331 transitions. Second operand 26 states. [2019-10-03 03:07:26,572 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-10-03 03:07:26,742 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-10-03 03:07:27,360 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 49 [2019-10-03 03:07:27,580 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2019-10-03 03:07:28,565 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-10-03 03:07:28,804 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2019-10-03 03:07:30,000 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-10-03 03:07:30,322 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-10-03 03:07:31,849 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2019-10-03 03:07:32,056 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-10-03 03:07:32,857 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-10-03 03:07:33,215 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 55 [2019-10-03 03:07:33,551 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-03 03:07:33,950 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-10-03 03:07:34,266 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 55 [2019-10-03 03:07:34,619 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-10-03 03:07:35,147 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-10-03 03:07:35,568 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 51 [2019-10-03 03:07:36,106 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-03 03:07:36,311 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-10-03 03:07:36,511 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2019-10-03 03:07:36,685 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-03 03:07:36,906 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-03 03:07:37,170 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-10-03 03:07:37,340 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 44 [2019-10-03 03:07:38,126 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2019-10-03 03:07:39,051 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-03 03:07:39,481 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-03 03:07:39,683 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-03 03:07:39,922 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-10-03 03:07:40,095 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 49 [2019-10-03 03:07:40,300 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-03 03:07:40,751 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2019-10-03 03:07:43,458 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-03 03:07:43,834 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-10-03 03:07:44,033 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-10-03 03:07:44,227 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 48 [2019-10-03 03:07:44,688 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-03 03:07:44,883 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-03 03:07:45,406 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-03 03:07:45,608 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-10-03 03:07:45,778 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-03 03:07:45,947 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-10-03 03:07:46,430 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-10-03 03:07:46,610 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-03 03:07:46,865 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-10-03 03:07:47,053 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-03 03:07:47,296 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-03 03:07:47,509 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-03 03:07:47,762 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-03 03:07:47,957 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-03 03:07:48,197 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-10-03 03:07:48,394 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-10-03 03:07:48,700 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-10-03 03:07:48,938 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-03 03:07:49,851 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-03 03:07:50,030 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-03 03:07:50,319 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-10-03 03:07:50,543 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-03 03:07:50,746 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-03 03:07:50,925 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-10-03 03:07:51,277 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-10-03 03:07:51,497 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-10-03 03:07:51,698 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-03 03:07:52,183 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-03 03:07:52,419 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-03 03:07:52,640 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-03 03:07:52,814 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-03 03:07:53,154 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-10-03 03:07:53,403 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-03 03:07:53,967 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-10-03 03:07:55,138 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-03 03:07:55,449 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-10-03 03:07:55,627 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-03 03:07:55,835 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-10-03 03:07:56,135 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 42 [2019-10-03 03:07:56,324 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-10-03 03:07:56,540 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-03 03:07:56,809 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-03 03:07:57,220 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 45 [2019-10-03 03:07:57,450 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-10-03 03:07:57,725 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-10-03 03:07:57,927 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2019-10-03 03:07:58,393 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-10-03 03:07:58,665 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 42 [2019-10-03 03:08:00,212 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 47 [2019-10-03 03:08:00,563 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-10-03 03:08:01,014 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 39 [2019-10-03 03:08:01,252 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-10-03 03:08:02,105 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-10-03 03:08:02,493 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 51 [2019-10-03 03:08:02,934 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-10-03 03:08:03,133 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-10-03 03:08:03,871 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-10-03 03:08:04,279 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-10-03 03:08:04,473 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-10-03 03:08:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:04,941 INFO L93 Difference]: Finished difference Result 455548 states and 539024 transitions. [2019-10-03 03:08:04,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-10-03 03:08:04,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-10-03 03:08:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:05,501 INFO L225 Difference]: With dead ends: 455548 [2019-10-03 03:08:05,501 INFO L226 Difference]: Without dead ends: 455548 [2019-10-03 03:08:05,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12435 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=6311, Invalid=32695, Unknown=0, NotChecked=0, Total=39006 [2019-10-03 03:08:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455548 states. [2019-10-03 03:08:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455548 to 118506. [2019-10-03 03:08:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118506 states. [2019-10-03 03:08:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118506 states to 118506 states and 141941 transitions. [2019-10-03 03:08:11,602 INFO L78 Accepts]: Start accepts. Automaton has 118506 states and 141941 transitions. Word has length 111 [2019-10-03 03:08:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:11,602 INFO L475 AbstractCegarLoop]: Abstraction has 118506 states and 141941 transitions. [2019-10-03 03:08:11,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 03:08:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 118506 states and 141941 transitions. [2019-10-03 03:08:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:08:11,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:11,607 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:11,607 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1362837389, now seen corresponding path program 1 times [2019-10-03 03:08:11,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:11,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:11,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:11,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:11,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:11,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:11,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-10-03 03:08:11,802 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [426], [429], [432], [435], [437], [439], [461], [471], [476], [481], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:08:11,804 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:11,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:11,812 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:11,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:08:11,960 INFO L272 AbstractInterpreter]: Visited 107 different actions 444 times. Merged at 41 different actions 307 times. Widened at 14 different actions 42 times. Performed 1405 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 13 different actions. Largest state had 117 variables. [2019-10-03 03:08:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:11,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:08:11,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:11,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:08:12,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:12,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:08:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:12,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-03 03:08:12,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:08:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:12,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:08:12,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:08:12,999 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:08:12,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [10] total 31 [2019-10-03 03:08:13,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:13,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:08:13,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:08:13,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:08:13,002 INFO L87 Difference]: Start difference. First operand 118506 states and 141941 transitions. Second operand 13 states. [2019-10-03 03:08:14,369 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-03 03:08:14,526 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-03 03:08:14,898 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-03 03:08:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:15,115 INFO L93 Difference]: Finished difference Result 123082 states and 146876 transitions. [2019-10-03 03:08:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 03:08:15,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-10-03 03:08:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:15,235 INFO L225 Difference]: With dead ends: 123082 [2019-10-03 03:08:15,235 INFO L226 Difference]: Without dead ends: 123082 [2019-10-03 03:08:15,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=366, Invalid=1890, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 03:08:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123082 states. [2019-10-03 03:08:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123082 to 116325. [2019-10-03 03:08:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116325 states. [2019-10-03 03:08:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116325 states to 116325 states and 139361 transitions. [2019-10-03 03:08:16,606 INFO L78 Accepts]: Start accepts. Automaton has 116325 states and 139361 transitions. Word has length 112 [2019-10-03 03:08:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:16,606 INFO L475 AbstractCegarLoop]: Abstraction has 116325 states and 139361 transitions. [2019-10-03 03:08:16,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:08:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 116325 states and 139361 transitions. [2019-10-03 03:08:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:08:16,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:16,611 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:16,611 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1417230287, now seen corresponding path program 1 times [2019-10-03 03:08:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:16,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:16,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:16,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:16,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-10-03 03:08:16,795 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [426], [429], [432], [435], [437], [439], [461], [471], [476], [479], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:08:16,797 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:16,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:16,808 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:17,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:08:17,013 INFO L272 AbstractInterpreter]: Visited 107 different actions 455 times. Merged at 41 different actions 316 times. Widened at 14 different actions 51 times. Performed 1460 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1460 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 117 variables. [2019-10-03 03:08:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:17,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:08:17,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:17,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:08:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:17,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:08:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:17,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:08:17,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:08:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:17,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:18,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:08:18,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:18,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:08:18,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-10-03 03:08:18,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:08:18,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:08:18,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:08:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:08:18,909 INFO L87 Difference]: Start difference. First operand 116325 states and 139361 transitions. Second operand 19 states. [2019-10-03 03:08:19,783 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:08:20,166 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-10-03 03:08:22,906 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-10-03 03:08:23,256 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-10-03 03:08:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:24,985 INFO L93 Difference]: Finished difference Result 258088 states and 308325 transitions. [2019-10-03 03:08:24,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:08:24,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2019-10-03 03:08:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:25,285 INFO L225 Difference]: With dead ends: 258088 [2019-10-03 03:08:25,285 INFO L226 Difference]: Without dead ends: 258088 [2019-10-03 03:08:25,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 192 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 03:08:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258088 states. [2019-10-03 03:08:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258088 to 116266. [2019-10-03 03:08:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116266 states. [2019-10-03 03:08:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116266 states to 116266 states and 139283 transitions. [2019-10-03 03:08:29,412 INFO L78 Accepts]: Start accepts. Automaton has 116266 states and 139283 transitions. Word has length 112 [2019-10-03 03:08:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:29,412 INFO L475 AbstractCegarLoop]: Abstraction has 116266 states and 139283 transitions. [2019-10-03 03:08:29,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:08:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 116266 states and 139283 transitions. [2019-10-03 03:08:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:08:29,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:29,418 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:29,418 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash -755250079, now seen corresponding path program 1 times [2019-10-03 03:08:29,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:29,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:30,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:30,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:30,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-10-03 03:08:30,537 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [198], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [367], [371], [384], [392], [395], [398], [401], [403], [426], [429], [432], [435], [437], [439], [461], [471], [476], [479], [514], [530], [556], [557], [561], [562], [563] [2019-10-03 03:08:30,544 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:30,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:30,551 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:30,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:08:30,601 INFO L272 AbstractInterpreter]: Visited 108 different actions 197 times. Merged at 40 different actions 79 times. Never widened. Performed 778 root evaluator evaluations with a maximum evaluation depth of 5. Performed 778 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 10 fixpoints after 6 different actions. Largest state had 117 variables. [2019-10-03 03:08:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:30,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:08:30,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:30,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:08:30,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:30,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:08:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:30,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-03 03:08:30,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:08:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:08:31,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:08:33,417 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-10-03 03:08:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:33,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 03:08:33,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [24, 19] total 51 [2019-10-03 03:08:33,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:33,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:08:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:08:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2226, Unknown=0, NotChecked=0, Total=2550 [2019-10-03 03:08:33,475 INFO L87 Difference]: Start difference. First operand 116266 states and 139283 transitions. Second operand 15 states. [2019-10-03 03:08:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:34,393 INFO L93 Difference]: Finished difference Result 104115 states and 124822 transitions. [2019-10-03 03:08:34,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:08:34,393 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2019-10-03 03:08:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:34,494 INFO L225 Difference]: With dead ends: 104115 [2019-10-03 03:08:34,494 INFO L226 Difference]: Without dead ends: 104115 [2019-10-03 03:08:34,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=488, Invalid=2704, Unknown=0, NotChecked=0, Total=3192 [2019-10-03 03:08:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104115 states. [2019-10-03 03:08:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104115 to 103211. [2019-10-03 03:08:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103211 states. [2019-10-03 03:08:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103211 states to 103211 states and 123775 transitions. [2019-10-03 03:08:35,325 INFO L78 Accepts]: Start accepts. Automaton has 103211 states and 123775 transitions. Word has length 113 [2019-10-03 03:08:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:35,325 INFO L475 AbstractCegarLoop]: Abstraction has 103211 states and 123775 transitions. [2019-10-03 03:08:35,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:08:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 103211 states and 123775 transitions. [2019-10-03 03:08:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:08:35,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:35,329 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:35,330 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash -135305689, now seen corresponding path program 1 times [2019-10-03 03:08:35,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:35,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:35,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:35,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:35,940 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-10-03 03:08:35,941 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [314], [318], [331], [339], [342], [345], [348], [350], [360], [363], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [459], [464], [469], [485], [493], [509], [556], [557], [561], [562], [563] [2019-10-03 03:08:35,942 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:35,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:35,953 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:36,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:08:36,084 INFO L272 AbstractInterpreter]: Visited 108 different actions 410 times. Merged at 42 different actions 277 times. Widened at 13 different actions 33 times. Performed 1342 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1342 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 10 different actions. Largest state had 117 variables. [2019-10-03 03:08:36,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:36,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:08:36,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:36,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:08:36,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:36,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:08:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:36,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 03:08:36,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:08:36,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:36,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:36,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:38,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:08:38,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:38,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:38,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:08:38,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 34 [2019-10-03 03:08:38,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:08:38,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-03 03:08:38,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-03 03:08:38,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 03:08:38,956 INFO L87 Difference]: Start difference. First operand 103211 states and 123775 transitions. Second operand 30 states. [2019-10-03 03:08:41,810 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-10-03 03:08:42,190 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-03 03:08:42,425 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-10-03 03:08:42,963 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-10-03 03:08:43,333 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-10-03 03:08:43,547 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-10-03 03:08:44,312 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-10-03 03:08:44,535 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-03 03:08:46,651 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-03 03:08:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:47,698 INFO L93 Difference]: Finished difference Result 342452 states and 412272 transitions. [2019-10-03 03:08:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-03 03:08:47,698 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 113 [2019-10-03 03:08:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:48,066 INFO L225 Difference]: With dead ends: 342452 [2019-10-03 03:08:48,066 INFO L226 Difference]: Without dead ends: 342452 [2019-10-03 03:08:48,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 196 SyntacticMatches, 19 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=653, Invalid=3379, Unknown=0, NotChecked=0, Total=4032 [2019-10-03 03:08:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342452 states. [2019-10-03 03:08:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342452 to 102854. [2019-10-03 03:08:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102854 states. [2019-10-03 03:08:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102854 states to 102854 states and 123348 transitions. [2019-10-03 03:08:52,334 INFO L78 Accepts]: Start accepts. Automaton has 102854 states and 123348 transitions. Word has length 113 [2019-10-03 03:08:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:52,335 INFO L475 AbstractCegarLoop]: Abstraction has 102854 states and 123348 transitions. [2019-10-03 03:08:52,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-03 03:08:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 102854 states and 123348 transitions. [2019-10-03 03:08:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 03:08:52,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:52,338 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:52,338 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1807639009, now seen corresponding path program 1 times [2019-10-03 03:08:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:52,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:52,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:52,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:52,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:52,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:52,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:52,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-10-03 03:08:52,835 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [556], [557], [561], [562], [563] [2019-10-03 03:08:52,836 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:52,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:52,845 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:52,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:08:52,957 INFO L272 AbstractInterpreter]: Visited 110 different actions 449 times. Merged at 40 different actions 308 times. Widened at 15 different actions 51 times. Performed 1473 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1473 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 10 different actions. Largest state had 118 variables. [2019-10-03 03:08:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:52,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:08:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:52,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:08:53,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:53,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:08:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:53,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 03:08:53,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:08:53,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:53,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:54,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:08:54,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:54,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:57,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 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-10-03 03:08:58,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:08:58,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 34 [2019-10-03 03:08:58,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:08:58,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-03 03:08:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-03 03:08:58,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 03:08:58,142 INFO L87 Difference]: Start difference. First operand 102854 states and 123348 transitions. Second operand 28 states. [2019-10-03 03:08:58,460 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-10-03 03:08:59,403 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-10-03 03:09:00,208 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-10-03 03:09:00,473 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-10-03 03:09:01,005 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-03 03:09:01,332 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:09:01,808 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-10-03 03:09:02,098 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:09:02,541 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:09:03,216 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-10-03 03:09:03,711 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2019-10-03 03:09:04,586 WARN L191 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-10-03 03:09:06,183 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2019-10-03 03:09:07,128 WARN L191 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-10-03 03:09:07,527 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-10-03 03:09:08,060 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-03 03:09:09,427 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 124 DAG size of output: 113 [2019-10-03 03:09:10,274 WARN L191 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-10-03 03:09:10,955 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2019-10-03 03:09:11,434 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-10-03 03:09:11,755 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-03 03:09:12,270 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-10-03 03:09:12,758 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-10-03 03:09:13,258 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-10-03 03:09:13,730 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-10-03 03:09:14,230 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-10-03 03:09:14,783 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-03 03:09:15,404 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-10-03 03:09:15,824 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:09:16,239 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-10-03 03:09:16,589 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-03 03:09:17,283 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-03 03:09:17,675 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-10-03 03:09:18,110 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-10-03 03:09:18,533 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-03 03:09:18,954 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:09:20,088 WARN L191 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-10-03 03:09:20,520 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:09:21,487 WARN L191 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-10-03 03:09:21,888 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-10-03 03:09:22,579 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-10-03 03:09:23,270 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:09:23,739 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-10-03 03:09:24,347 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-10-03 03:09:25,086 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2019-10-03 03:09:25,467 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-10-03 03:09:25,899 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-10-03 03:09:26,471 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-03 03:09:26,794 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-10-03 03:09:27,140 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-03 03:09:27,380 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-10-03 03:09:28,064 WARN L191 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-10-03 03:09:28,417 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-03 03:09:28,941 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:09:29,180 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:09:30,270 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 123 DAG size of output: 116 [2019-10-03 03:09:30,986 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2019-10-03 03:09:31,278 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-03 03:09:31,708 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-10-03 03:09:32,038 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2019-10-03 03:09:32,672 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-10-03 03:09:33,199 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 108 [2019-10-03 03:09:33,527 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-10-03 03:09:33,901 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-10-03 03:09:34,609 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-10-03 03:09:35,239 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:09:35,671 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2019-10-03 03:09:35,983 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-10-03 03:09:36,692 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:09:37,017 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-10-03 03:09:37,464 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:09:37,939 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-10-03 03:09:38,411 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-03 03:09:38,874 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-10-03 03:09:39,287 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:09:39,980 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2019-10-03 03:09:40,345 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-10-03 03:09:40,938 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2019-10-03 03:09:41,275 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-03 03:09:41,617 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-10-03 03:09:41,987 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-03 03:09:42,493 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:09:42,856 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:09:43,216 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:09:43,556 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:09:44,012 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-10-03 03:09:44,369 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-10-03 03:09:44,736 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-03 03:09:45,223 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-10-03 03:09:45,596 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-10-03 03:09:45,935 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-10-03 03:09:46,257 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-03 03:09:46,953 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-10-03 03:09:47,238 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-03 03:09:47,640 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-10-03 03:09:47,881 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-03 03:09:48,311 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-10-03 03:09:48,896 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-10-03 03:09:49,225 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-10-03 03:09:49,756 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-03 03:09:50,222 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-03 03:09:50,843 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-10-03 03:09:51,489 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:09:51,841 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-10-03 03:09:52,339 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-10-03 03:09:52,746 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-03 03:09:53,437 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-10-03 03:09:53,701 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-03 03:09:53,940 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-10-03 03:09:54,535 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-10-03 03:09:54,938 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-03 03:09:55,191 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-10-03 03:09:55,572 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-03 03:09:55,875 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-10-03 03:09:56,233 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-03 03:09:56,796 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:09:57,299 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-10-03 03:09:57,851 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 110 [2019-10-03 03:09:58,195 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-03 03:09:58,830 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:09:59,328 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-10-03 03:09:59,645 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-03 03:10:00,136 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-10-03 03:10:01,026 WARN L191 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:10:01,405 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2019-10-03 03:10:01,784 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-03 03:10:02,216 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-03 03:10:02,694 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-03 03:10:03,149 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-03 03:10:03,945 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-03 03:10:04,499 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-10-03 03:10:04,955 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-10-03 03:10:05,251 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-03 03:10:05,773 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-10-03 03:10:06,144 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-10-03 03:10:06,537 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-10-03 03:10:06,974 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-10-03 03:10:07,406 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-10-03 03:10:07,963 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-10-03 03:10:08,576 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-10-03 03:10:08,995 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-03 03:10:09,476 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2019-10-03 03:10:10,002 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-03 03:10:10,553 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-10-03 03:10:11,170 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 111 [2019-10-03 03:10:11,865 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-03 03:10:12,230 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-10-03 03:10:12,756 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-10-03 03:10:13,315 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-10-03 03:10:13,898 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-03 03:10:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:14,406 INFO L93 Difference]: Finished difference Result 248058 states and 294456 transitions. [2019-10-03 03:10:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-10-03 03:10:14,407 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 115 [2019-10-03 03:10:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:14,693 INFO L225 Difference]: With dead ends: 248058 [2019-10-03 03:10:14,693 INFO L226 Difference]: Without dead ends: 248058 [2019-10-03 03:10:14,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 183 SyntacticMatches, 33 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13571 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=6016, Invalid=29140, Unknown=0, NotChecked=0, Total=35156 [2019-10-03 03:10:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248058 states. [2019-10-03 03:10:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248058 to 102819. [2019-10-03 03:10:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102819 states. [2019-10-03 03:10:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102819 states to 102819 states and 123302 transitions. [2019-10-03 03:10:16,404 INFO L78 Accepts]: Start accepts. Automaton has 102819 states and 123302 transitions. Word has length 115 [2019-10-03 03:10:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:16,405 INFO L475 AbstractCegarLoop]: Abstraction has 102819 states and 123302 transitions. [2019-10-03 03:10:16,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-03 03:10:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 102819 states and 123302 transitions. [2019-10-03 03:10:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 03:10:16,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:16,408 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:16,408 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash -513025811, now seen corresponding path program 1 times [2019-10-03 03:10:16,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:16,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:16,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:16,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:16,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:10:16,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:16,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-03 03:10:16,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:16,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 03:10:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 03:10:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:10:16,899 INFO L87 Difference]: Start difference. First operand 102819 states and 123302 transitions. Second operand 20 states. [2019-10-03 03:10:17,075 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-03 03:10:17,808 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-03 03:10:17,986 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-03 03:10:18,326 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-03 03:10:18,560 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-10-03 03:10:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:23,572 INFO L93 Difference]: Finished difference Result 302890 states and 363704 transitions. [2019-10-03 03:10:23,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:10:23,572 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 115 [2019-10-03 03:10:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:23,937 INFO L225 Difference]: With dead ends: 302890 [2019-10-03 03:10:23,937 INFO L226 Difference]: Without dead ends: 302890 [2019-10-03 03:10:23,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 03:10:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302890 states. [2019-10-03 03:10:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302890 to 102613. [2019-10-03 03:10:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102613 states. [2019-10-03 03:10:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102613 states to 102613 states and 123055 transitions. [2019-10-03 03:10:25,662 INFO L78 Accepts]: Start accepts. Automaton has 102613 states and 123055 transitions. Word has length 115 [2019-10-03 03:10:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:25,662 INFO L475 AbstractCegarLoop]: Abstraction has 102613 states and 123055 transitions. [2019-10-03 03:10:25,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 03:10:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 102613 states and 123055 transitions. [2019-10-03 03:10:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:10:25,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:25,666 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:25,667 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2100716967, now seen corresponding path program 1 times [2019-10-03 03:10:25,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:25,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:26,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:26,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:10:26,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:26,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:10:26,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:10:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:10:26,002 INFO L87 Difference]: Start difference. First operand 102613 states and 123055 transitions. Second operand 12 states. [2019-10-03 03:10:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:28,847 INFO L93 Difference]: Finished difference Result 140408 states and 168737 transitions. [2019-10-03 03:10:28,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:10:28,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-10-03 03:10:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:28,987 INFO L225 Difference]: With dead ends: 140408 [2019-10-03 03:10:28,987 INFO L226 Difference]: Without dead ends: 140408 [2019-10-03 03:10:28,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:10:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140408 states. [2019-10-03 03:10:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140408 to 113652. [2019-10-03 03:10:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113652 states. [2019-10-03 03:10:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113652 states to 113652 states and 136325 transitions. [2019-10-03 03:10:30,018 INFO L78 Accepts]: Start accepts. Automaton has 113652 states and 136325 transitions. Word has length 116 [2019-10-03 03:10:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:30,018 INFO L475 AbstractCegarLoop]: Abstraction has 113652 states and 136325 transitions. [2019-10-03 03:10:30,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:10:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 113652 states and 136325 transitions. [2019-10-03 03:10:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 03:10:30,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:30,022 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:30,022 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1980605352, now seen corresponding path program 1 times [2019-10-03 03:10:30,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:30,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:30,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:30,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:10:30,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:10:30,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-10-03 03:10:30,526 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [464], [469], [556], [557], [561], [562], [563] [2019-10-03 03:10:30,528 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:10:30,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:10:30,535 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:10:30,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:10:30,590 INFO L272 AbstractInterpreter]: Visited 113 different actions 243 times. Merged at 42 different actions 117 times. Never widened. Performed 913 root evaluator evaluations with a maximum evaluation depth of 5. Performed 913 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 7 different actions. Largest state had 118 variables. [2019-10-03 03:10:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:30,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:10:30,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:10:30,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:10:30,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:30,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:10:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:30,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:10:30,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:10:30,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:30,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:30,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:31,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:31,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:10:31,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,407 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-10-03 03:10:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:32,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:10:32,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 41 [2019-10-03 03:10:32,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:10:32,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-03 03:10:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-03 03:10:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:10:32,458 INFO L87 Difference]: Start difference. First operand 113652 states and 136325 transitions. Second operand 31 states. [2019-10-03 03:10:32,693 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-03 03:10:33,942 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-03 03:10:34,974 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:10:37,276 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-03 03:10:37,577 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-10-03 03:10:38,172 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-03 03:10:38,453 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:10:38,897 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:10:40,873 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-03 03:10:41,461 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-03 03:10:41,831 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-03 03:10:42,047 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:10:42,298 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:10:43,004 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-03 03:10:43,208 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-03 03:10:43,768 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:10:44,120 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-10-03 03:10:44,358 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-03 03:10:44,745 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-03 03:10:44,984 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-03 03:10:45,247 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:10:45,704 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:10:46,125 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-03 03:10:47,077 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-10-03 03:10:47,269 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-03 03:10:48,207 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:10:48,584 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-10-03 03:10:48,752 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:10:48,962 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:10:49,154 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-10-03 03:10:50,068 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-10-03 03:10:50,818 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:10:51,223 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-03 03:10:51,406 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-03 03:10:52,138 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:10:52,498 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:10:52,702 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-03 03:10:52,909 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:10:53,446 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-03 03:10:53,677 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:10:53,929 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:10:54,169 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:10:54,531 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:10:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:57,605 INFO L93 Difference]: Finished difference Result 322987 states and 386618 transitions. [2019-10-03 03:10:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-10-03 03:10:57,605 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2019-10-03 03:10:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:11:00,676 INFO L225 Difference]: With dead ends: 322987 [2019-10-03 03:11:00,676 INFO L226 Difference]: Without dead ends: 322987 [2019-10-03 03:11:00,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6317 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=3498, Invalid=18852, Unknown=0, NotChecked=0, Total=22350 [2019-10-03 03:11:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322987 states. [2019-10-03 03:11:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322987 to 130363. [2019-10-03 03:11:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130363 states. [2019-10-03 03:11:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130363 states to 130363 states and 156467 transitions. [2019-10-03 03:11:02,552 INFO L78 Accepts]: Start accepts. Automaton has 130363 states and 156467 transitions. Word has length 118 [2019-10-03 03:11:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:11:02,552 INFO L475 AbstractCegarLoop]: Abstraction has 130363 states and 156467 transitions. [2019-10-03 03:11:02,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-03 03:11:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 130363 states and 156467 transitions. [2019-10-03 03:11:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 03:11:02,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:11:02,556 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:11:02,556 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:11:02,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:11:02,557 INFO L82 PathProgramCache]: Analyzing trace with hash 283339632, now seen corresponding path program 1 times [2019-10-03 03:11:02,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:11:02,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:02,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:11:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:02,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:11:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:11:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:11:03,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:11:03,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:11:03,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-10-03 03:11:03,425 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [145], [147], [150], [153], [156], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [452], [457], [556], [557], [561], [562], [563] [2019-10-03 03:11:03,429 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:11:03,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:11:03,438 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:11:03,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:11:03,559 INFO L272 AbstractInterpreter]: Visited 113 different actions 323 times. Merged at 42 different actions 192 times. Widened at 7 different actions 12 times. Performed 1110 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 8 different actions. Largest state had 118 variables. [2019-10-03 03:11:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:11:03,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:11:03,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:11:03,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:11:03,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:11:03,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:11:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:11:03,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-03 03:11:03,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:11:04,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:11:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:11:04,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:11:05,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:11:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:11:06,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:11:06,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 61 [2019-10-03 03:11:06,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:11:06,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-03 03:11:06,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-03 03:11:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3365, Unknown=0, NotChecked=0, Total=3660 [2019-10-03 03:11:06,672 INFO L87 Difference]: Start difference. First operand 130363 states and 156467 transitions. Second operand 41 states. [2019-10-03 03:11:22,856 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-10-03 03:11:23,309 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-03 03:11:23,547 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-10-03 03:11:23,811 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-10-03 03:11:24,043 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:11:24,555 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-10-03 03:11:24,947 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-10-03 03:11:25,442 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-03 03:11:26,593 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-03 03:11:27,179 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-03 03:11:28,253 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-03 03:11:29,259 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-03 03:11:30,363 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-10-03 03:11:30,608 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-03 03:11:31,430 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-10-03 03:11:31,948 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-03 03:11:32,286 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-10-03 03:11:32,590 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-10-03 03:11:32,938 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-03 03:11:33,314 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-03 03:11:34,048 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-10-03 03:11:34,297 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-10-03 03:11:34,691 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-03 03:11:34,922 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-03 03:11:35,449 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-03 03:11:36,007 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-03 03:11:36,553 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-03 03:11:36,925 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-03 03:11:37,160 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-03 03:11:38,471 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-03 03:11:39,113 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-03 03:11:39,294 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-03 03:11:39,987 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:11:41,269 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-03 03:11:41,472 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-03 03:11:41,757 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-03 03:11:41,964 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-03 03:11:42,156 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-03 03:11:43,546 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-03 03:11:45,561 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:11:46,831 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-03 03:11:48,118 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:11:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:11:52,603 INFO L93 Difference]: Finished difference Result 402365 states and 483117 transitions. [2019-10-03 03:11:52,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-10-03 03:11:52,604 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2019-10-03 03:11:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:11:53,053 INFO L225 Difference]: With dead ends: 402365 [2019-10-03 03:11:53,053 INFO L226 Difference]: Without dead ends: 402365 [2019-10-03 03:11:53,055 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10808 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=4282, Invalid=33160, Unknown=0, NotChecked=0, Total=37442 [2019-10-03 03:11:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402365 states. [2019-10-03 03:11:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402365 to 144063. [2019-10-03 03:11:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144063 states. [2019-10-03 03:11:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144063 states to 144063 states and 173073 transitions. [2019-10-03 03:11:55,986 INFO L78 Accepts]: Start accepts. Automaton has 144063 states and 173073 transitions. Word has length 118 [2019-10-03 03:11:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:11:55,986 INFO L475 AbstractCegarLoop]: Abstraction has 144063 states and 173073 transitions. [2019-10-03 03:11:55,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-03 03:11:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 144063 states and 173073 transitions. [2019-10-03 03:11:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 03:11:55,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:11:55,990 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:11:55,990 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:11:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:11:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1839164779, now seen corresponding path program 1 times [2019-10-03 03:11:55,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:11:55,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:55,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:11:55,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:55,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:11:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:11:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:11:56,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:11:56,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-03 03:11:56,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:11:56,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 03:11:56,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 03:11:56,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:11:56,588 INFO L87 Difference]: Start difference. First operand 144063 states and 173073 transitions. Second operand 21 states. [2019-10-03 03:12:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:12:04,689 INFO L93 Difference]: Finished difference Result 379288 states and 455052 transitions. [2019-10-03 03:12:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-03 03:12:04,690 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 118 [2019-10-03 03:12:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:12:05,074 INFO L225 Difference]: With dead ends: 379288 [2019-10-03 03:12:05,074 INFO L226 Difference]: Without dead ends: 379288 [2019-10-03 03:12:05,074 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=726, Invalid=3966, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 03:12:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379288 states. [2019-10-03 03:12:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379288 to 148028. [2019-10-03 03:12:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148028 states. [2019-10-03 03:12:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148028 states to 148028 states and 177810 transitions. [2019-10-03 03:12:07,955 INFO L78 Accepts]: Start accepts. Automaton has 148028 states and 177810 transitions. Word has length 118 [2019-10-03 03:12:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:12:07,955 INFO L475 AbstractCegarLoop]: Abstraction has 148028 states and 177810 transitions. [2019-10-03 03:12:07,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 03:12:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 148028 states and 177810 transitions. [2019-10-03 03:12:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 03:12:07,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:12:07,963 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:12:07,963 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:12:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 906273071, now seen corresponding path program 1 times [2019-10-03 03:12:07,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:12:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:07,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:07,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:07,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:12:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:12:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 03:12:08,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:12:08,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:12:08,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:12:08,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:12:08,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:12:08,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:12:08,019 INFO L87 Difference]: Start difference. First operand 148028 states and 177810 transitions. Second operand 3 states. [2019-10-03 03:12:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:12:08,149 INFO L93 Difference]: Finished difference Result 69756 states and 81899 transitions. [2019-10-03 03:12:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:12:08,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-03 03:12:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:12:08,206 INFO L225 Difference]: With dead ends: 69756 [2019-10-03 03:12:08,207 INFO L226 Difference]: Without dead ends: 69756 [2019-10-03 03:12:08,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:12:08,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69756 states. [2019-10-03 03:12:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69756 to 67493. [2019-10-03 03:12:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67493 states. [2019-10-03 03:12:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67493 states to 67493 states and 79374 transitions. [2019-10-03 03:12:08,686 INFO L78 Accepts]: Start accepts. Automaton has 67493 states and 79374 transitions. Word has length 137 [2019-10-03 03:12:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:12:08,687 INFO L475 AbstractCegarLoop]: Abstraction has 67493 states and 79374 transitions. [2019-10-03 03:12:08,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:12:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 67493 states and 79374 transitions. [2019-10-03 03:12:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 03:12:08,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:12:08,692 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:12:08,692 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:12:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 766030200, now seen corresponding path program 1 times [2019-10-03 03:12:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:12:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:08,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:08,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:12:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:12:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:12:08,844 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 03:12:09,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:12:09 BoogieIcfgContainer [2019-10-03 03:12:09,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:12:09,038 INFO L168 Benchmark]: Toolchain (without parser) took 632751.24 ms. Allocated memory was 134.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 89.3 MB in the beginning and 956.0 MB in the end (delta: -866.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-10-03 03:12:09,038 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-03 03:12:09,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.87 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 89.1 MB in the beginning and 170.7 MB in the end (delta: -81.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-10-03 03:12:09,038 INFO L168 Benchmark]: Boogie Preprocessor took 80.13 ms. Allocated memory is still 199.2 MB. Free memory was 170.7 MB in the beginning and 168.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-03 03:12:09,038 INFO L168 Benchmark]: RCFGBuilder took 919.05 ms. Allocated memory is still 199.2 MB. Free memory was 168.2 MB in the beginning and 112.3 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2019-10-03 03:12:09,039 INFO L168 Benchmark]: TraceAbstraction took 631055.59 ms. Allocated memory was 199.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 111.7 MB in the beginning and 956.0 MB in the end (delta: -844.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-10-03 03:12:09,040 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.29 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.87 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 89.1 MB in the beginning and 170.7 MB in the end (delta: -81.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.13 ms. Allocated memory is still 199.2 MB. Free memory was 170.7 MB in the beginning and 168.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 919.05 ms. Allocated memory is still 199.2 MB. Free memory was 168.2 MB in the beginning and 112.3 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 631055.59 ms. Allocated memory was 199.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 111.7 MB in the beginning and 956.0 MB in the end (delta: -844.3 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: 377]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] unsigned char r1 = '\x0'; [L14] port_t p1 = 0; [L15] char p1_old = '\x0'; [L16] char p1_new = '\x0'; [L17] char id1 = '\x0'; [L18] char st1 = '\x0'; [L19] msg_t send1 = '\x0'; [L20] _Bool mode1 = 0; [L21] _Bool alive1 = 0; [L22] port_t p2 = 0; [L23] char p2_old = '\x0'; [L24] char p2_new = '\x0'; [L25] char id2 = '\x0'; [L26] char st2 = '\x0'; [L27] msg_t send2 = '\x0'; [L28] _Bool mode2 = 0; [L29] _Bool alive2 = 0; [L30] port_t p3 = 0; [L31] char p3_old = '\x0'; [L32] char p3_new = '\x0'; [L33] char id3 = '\x0'; [L34] char st3 = '\x0'; [L35] msg_t send3 = '\x0'; [L36] _Bool mode3 = 0; [L37] _Bool alive3 = 0; [L41] void (*nodes[3])() = { &node1, &node2, &node3 }; [L45] int __return_5979; [L46] int __return_6056; [L47] int __return_6117; [L48] int __return_6183; [L49] int __return_6353; VAL [\old(__return_5979)=264, \old(__return_6056)=265, \old(__return_6117)=275, \old(__return_6183)=266, \old(__return_6353)=263, \old(__return_main)=282, \old(alive1)=13, \old(alive2)=27, \old(alive3)=28, \old(id1)=259, \old(id2)=287, \old(id3)=278, \old(mode1)=23, \old(mode2)=29, \old(mode3)=16, \old(nomsg)=268, \old(p1)=289, \old(p1_new)=273, \old(p1_old)=288, \old(p2)=260, \old(p2_new)=271, \old(p2_old)=277, \old(p3)=267, \old(p3_new)=280, \old(p3_old)=276, \old(r1)=14, \old(send1)=281, \old(send2)=261, \old(send3)=258, \old(st1)=262, \old(st2)=286, \old(st3)=274, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=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] [L52] int main__c1; [L53] int main__i2; [L54] main__c1 = 0 [L55] r1 = __VERIFIER_nondet_uchar() [L56] id1 = __VERIFIER_nondet_char() [L57] st1 = __VERIFIER_nondet_char() [L58] send1 = __VERIFIER_nondet_char() [L59] mode1 = __VERIFIER_nondet_bool() [L60] alive1 = __VERIFIER_nondet_bool() [L61] id2 = __VERIFIER_nondet_char() [L62] st2 = __VERIFIER_nondet_char() [L63] send2 = __VERIFIER_nondet_char() [L64] mode2 = __VERIFIER_nondet_bool() [L65] alive2 = __VERIFIER_nondet_bool() [L66] id3 = __VERIFIER_nondet_char() [L67] st3 = __VERIFIER_nondet_char() [L68] send3 = __VERIFIER_nondet_char() [L69] mode3 = __VERIFIER_nondet_bool() [L70] alive3 = __VERIFIER_nondet_bool() [L72] int init__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L73] COND TRUE ((int)r1) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L75] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L77] COND TRUE ((int)id1) >= 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L79] COND TRUE ((int)st1) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L81] COND TRUE ((int)send1) == ((int)id1) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L83] COND TRUE ((int)mode1) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L85] COND TRUE ((int)id2) >= 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L87] COND TRUE ((int)st2) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L89] COND TRUE ((int)send2) == ((int)id2) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L91] COND TRUE ((int)mode2) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L93] COND TRUE ((int)id3) >= 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L95] COND TRUE ((int)st3) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L97] COND TRUE ((int)send3) == ((int)id3) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L99] COND TRUE ((int)mode3) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L101] COND TRUE ((int)id1) != ((int)id2) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L103] COND TRUE ((int)id1) != ((int)id3) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L105] COND TRUE ((int)id2) != ((int)id3) [L107] init__tmp = 1 [L108] __return_5979 = init__tmp [L109] main__i2 = __return_5979 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L110] COND TRUE main__i2 != 0 [L112] p1_old = nomsg [L113] p1_new = nomsg [L114] p2_old = nomsg [L115] p2_new = nomsg [L116] p3_old = nomsg [L117] p3_new = nomsg [L118] main__i2 = 0 [L120] msg_t node1__m1; [L121] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L122] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L128] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L139] mode1 = 1 [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L149] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L907] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L160] mode2 = 1 [L162] msg_t node3__m3; [L163] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L164] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L170] COND TRUE !(alive3 == 0) [L172] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L173] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L175] COND TRUE p3_new == nomsg [L177] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L179] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L181] mode3 = 1 [L182] p1_old = p1_new [L183] p1_new = nomsg [L184] p2_old = p2_new [L185] p2_new = nomsg [L186] p3_old = p3_new [L187] p3_new = nomsg [L189] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L190] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)r1) < 3 [L194] check__tmp = 1 [L195] __return_6056 = check__tmp [L196] main__c1 = __return_6056 [L198] _Bool __tmp_1; [L199] __tmp_1 = main__c1 [L200] _Bool assert__arg; [L201] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, 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=3, send3=127, st1=0, st2=0, st3=0] [L202] COND FALSE !(assert__arg == 0) [L209] msg_t node1__m1; [L210] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L211] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L213] COND FALSE !(r1 == 255) [L219] r1 = r1 + 1 [L220] node1__m1 = p3_old [L221] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L222] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L224] COND FALSE !(!(alive1 == 0)) [L821] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L231] mode1 = 0 [L233] msg_t node2__m2; [L234] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L235] COND TRUE !(mode2 == 0) [L237] node2__m2 = p1_old [L238] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L239] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L248] mode2 = 0 [L250] msg_t node3__m3; [L251] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L252] COND TRUE !(mode3 == 0) [L254] node3__m3 = p2_old [L255] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L256] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L265] mode3 = 0 [L266] p1_old = p1_new [L267] p1_new = nomsg [L268] p2_old = p2_new [L269] p2_new = nomsg [L270] p3_old = p3_new [L271] p3_new = nomsg [L273] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L274] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L276] COND TRUE ((int)r1) < 3 [L278] check__tmp = 1 [L279] __return_6117 = check__tmp [L280] main__c1 = __return_6117 [L282] _Bool __tmp_2; [L283] __tmp_2 = main__c1 [L284] _Bool assert__arg; [L285] assert__arg = __tmp_2 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L286] COND FALSE !(assert__arg == 0) [L293] msg_t node1__m1; [L294] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L295] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L697] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L708] mode1 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, 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=3, send3=127, st1=0, st2=0, st3=0] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=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=3, send3=127, st1=0, st2=0, st3=0] [L319] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L606] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L634] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L617] mode2 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L337] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L520] COND TRUE !(alive3 == 0) [L522] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L523] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L525] COND TRUE p3_new == nomsg [L527] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L529] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L531] mode3 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L362] COND TRUE ((int)r1) < 3 [L364] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) [L383] msg_t node1__m1; [L384] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L385] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L387] COND FALSE !(r1 == 255) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L391] r1 = r1 + 1 [L392] node1__m1 = p3_old [L393] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L394] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L396] COND FALSE !(!(alive1 == 0)) [L422] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L403] mode1 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L319] COND TRUE !(mode2 == 0) [L321] node2__m2 = p1_old [L322] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L323] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L332] mode2 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L337] COND TRUE !(mode3 == 0) [L339] node3__m3 = p2_old [L340] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L341] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L350] mode3 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L362] COND TRUE ((int)r1) < 3 [L364] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) [L383] msg_t node1__m1; [L384] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L385] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L438] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L449] mode1 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L319] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L606] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L634] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L617] mode2 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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____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=3, send3=127, st1=0, st2=0, st3=0] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L337] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L520] COND TRUE !(alive3 == 0) [L522] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L523] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L525] COND TRUE p3_new == nomsg [L527] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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____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=3, send3=127, st1=0, st2=0, st3=0] [L529] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L531] mode3 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=127, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L362] COND TRUE ((int)r1) < 3 [L364] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) [L383] msg_t node1__m1; [L384] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L385] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L387] COND FALSE !(r1 == 255) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L391] r1 = r1 + 1 [L392] node1__m1 = p3_old [L393] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L394] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L396] COND FALSE !(!(alive1 == 0)) [L422] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L403] mode1 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L319] COND TRUE !(mode2 == 0) [L321] node2__m2 = p1_old [L322] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L323] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L332] mode2 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L337] COND TRUE !(mode3 == 0) [L339] node3__m3 = p2_old [L340] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L341] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L350] mode3 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L362] COND FALSE !(((int)r1) < 3) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L475] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L482] check__tmp = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=0, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=0, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L375] COND TRUE assert__arg == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, 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=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] [L377] __VERIFIER_error() VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=0, check__tmp=1, check__tmp=1, check__tmp=0, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, 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=3, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 152 locations, 1 error locations. UNSAFE Result, 630.9s OverallTime, 61 OverallIterations, 4 TraceHistogramMax, 503.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18240 SDtfs, 88596 SDslu, 144423 SDs, 0 SdLazy, 96064 SolverSat, 5690 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 115.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5226 GetRequests, 2564 SyntacticMatches, 99 SemanticMatches, 2563 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153199 ImplicationChecksByTransitivity, 249.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178306occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 15 AbstIntIterations, 3 AbstIntStrong, 0.9859099351296443 AbsIntWeakeningRatio, 1.3271028037383177 AbsIntAvgWeakeningVarsNumRemoved, 27.838006230529594 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 71.6s AutomataMinimizationTime, 60 MinimizatonAttempts, 2622043 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 6468 NumberOfCodeBlocks, 6468 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 7573 ConstructedInterpolants, 370 QuantifiedInterpolants, 9243654 SizeOfPredicates, 92 NumberOfNonLiveVariables, 8168 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 84 InterpolantComputations, 52 PerfectInterpolantSequences, 422/525 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...