./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16f1bfcdafcb30da29b0067c09066abcd5ae81f862f6e318335df039804ff932 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:44:29,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:44:29,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:44:29,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:44:29,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:44:29,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:44:29,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:44:29,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:44:29,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:44:29,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:44:29,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:44:29,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:44:29,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:44:29,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:44:29,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:44:29,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:44:29,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:44:29,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:44:29,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:44:29,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:44:29,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:44:29,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:44:29,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:44:29,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:44:29,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:44:29,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:44:29,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:44:29,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:44:29,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:44:29,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:44:29,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:44:29,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:44:29,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:44:29,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:44:29,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:44:29,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:44:29,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:44:29,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:44:29,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:44:29,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:44:29,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:44:29,482 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:44:29,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:44:29,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:44:29,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:44:29,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:44:29,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:44:29,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:44:29,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:44:29,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:44:29,517 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:44:29,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:44:29,518 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:44:29,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:44:29,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:44:29,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:44:29,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:44:29,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:44:29,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:44:29,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:44:29,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:44:29,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:44:29,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:44:29,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:44:29,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:44:29,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:44:29,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:29,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:44:29,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:44:29,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:44:29,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:44:29,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:44:29,521 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:44:29,521 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:44:29,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:44:29,522 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16f1bfcdafcb30da29b0067c09066abcd5ae81f862f6e318335df039804ff932 [2022-02-20 18:44:29,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:44:29,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:44:29,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:44:29,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:44:29,775 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:44:29,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:44:29,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5e0b665/620e583b41e8467d8153f46a1857db91/FLAG07862f493 [2022-02-20 18:44:30,375 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:44:30,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:44:30,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5e0b665/620e583b41e8467d8153f46a1857db91/FLAG07862f493 [2022-02-20 18:44:30,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5e0b665/620e583b41e8467d8153f46a1857db91 [2022-02-20 18:44:30,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:44:30,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:44:30,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:30,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:44:30,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:44:30,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a8cee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:30, skipping insertion in model container [2022-02-20 18:44:30,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:30" (1/1) ... [2022-02-20 18:44:30,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:44:30,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:44:30,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8112,8125] [2022-02-20 18:44:30,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14224,14237] [2022-02-20 18:44:30,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16311,16324] [2022-02-20 18:44:30,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17335,17348] [2022-02-20 18:44:31,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:31,210 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:44:31,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8112,8125] [2022-02-20 18:44:31,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14224,14237] [2022-02-20 18:44:31,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16311,16324] [2022-02-20 18:44:31,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17335,17348] [2022-02-20 18:44:31,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:31,385 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:44:31,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31 WrapperNode [2022-02-20 18:44:31,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:31,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:31,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:44:31,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:44:31,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,516 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2377 [2022-02-20 18:44:31,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:31,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:44:31,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:44:31,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:44:31,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:44:31,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:44:31,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:44:31,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:44:31,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (1/1) ... [2022-02-20 18:44:31,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:31,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:31,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:44:31,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:44:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:44:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:44:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:44:31,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:44:31,885 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:44:31,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:44:33,355 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:44:33,365 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:44:33,365 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:44:33,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:33 BoogieIcfgContainer [2022-02-20 18:44:33,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:44:33,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:44:33,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:44:33,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:44:33,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:44:30" (1/3) ... [2022-02-20 18:44:33,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb9ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:33, skipping insertion in model container [2022-02-20 18:44:33,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:31" (2/3) ... [2022-02-20 18:44:33,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb9ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:33, skipping insertion in model container [2022-02-20 18:44:33,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:33" (3/3) ... [2022-02-20 18:44:33,375 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:44:33,379 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:44:33,380 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 18:44:33,420 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:44:33,426 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:44:33,426 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 18:44:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 441 states, 436 states have (on average 1.8577981651376148) internal successors, (810), 440 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:44:33,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:33,466 INFO L514 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] [2022-02-20 18:44:33,467 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:33,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1113444986, now seen corresponding path program 1 times [2022-02-20 18:44:33,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:33,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080196460] [2022-02-20 18:44:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:33,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {444#true} is VALID [2022-02-20 18:44:33,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {444#true} is VALID [2022-02-20 18:44:33,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} assume 0 == ~r1~0 % 256; {444#true} is VALID [2022-02-20 18:44:33,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {444#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {444#true} is VALID [2022-02-20 18:44:33,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#true} assume ~id1~0 >= 0; {444#true} is VALID [2022-02-20 18:44:33,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#true} assume 0 == ~st1~0; {444#true} is VALID [2022-02-20 18:44:33,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#true} assume ~send1~0 == ~id1~0; {444#true} is VALID [2022-02-20 18:44:33,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {444#true} assume 0 == ~mode1~0 % 256; {444#true} is VALID [2022-02-20 18:44:33,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#true} assume ~id2~0 >= 0; {444#true} is VALID [2022-02-20 18:44:33,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#true} assume 0 == ~st2~0; {444#true} is VALID [2022-02-20 18:44:33,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {444#true} assume ~send2~0 == ~id2~0; {444#true} is VALID [2022-02-20 18:44:33,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#true} assume 0 == ~mode2~0 % 256; {444#true} is VALID [2022-02-20 18:44:33,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {444#true} assume ~id3~0 >= 0; {444#true} is VALID [2022-02-20 18:44:33,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {444#true} assume 0 == ~st3~0; {444#true} is VALID [2022-02-20 18:44:33,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {444#true} assume ~send3~0 == ~id3~0; {444#true} is VALID [2022-02-20 18:44:33,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {444#true} assume 0 == ~mode3~0 % 256; {444#true} is VALID [2022-02-20 18:44:33,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#true} assume ~id1~0 != ~id2~0; {444#true} is VALID [2022-02-20 18:44:33,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {444#true} assume ~id1~0 != ~id3~0; {444#true} is VALID [2022-02-20 18:44:33,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {444#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {444#true} is VALID [2022-02-20 18:44:33,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {444#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {444#true} is VALID [2022-02-20 18:44:33,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {444#true} assume !!(0 == ~mode1~0 % 256); {444#true} is VALID [2022-02-20 18:44:33,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {444#true} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {444#true} is VALID [2022-02-20 18:44:33,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {444#true} assume !!(0 == ~mode2~0 % 256); {444#true} is VALID [2022-02-20 18:44:33,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {444#true} assume !!(0 == ~alive2~0 % 256); {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~16#1;main_~node3__m3~16#1 := ~nomsg~0; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~id3~0);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~56#1; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~56#1 := 1;~__return_8127~0 := main_~check__tmp~56#1;main_~main__c1~0#1 := ~__return_8127~0;havoc main_~__tmp_56~0#1;main_~__tmp_56~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~55#1;main_~assert__arg~55#1 := main_~__tmp_56~0#1; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == main_~assert__arg~55#1 % 256); {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode1~0 % 256); {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:33,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {446#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {445#false} is VALID [2022-02-20 18:44:33,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {445#false} assume !(main_~node2__m2~1#1 > ~id2~0); {445#false} is VALID [2022-02-20 18:44:33,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {445#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {445#false} is VALID [2022-02-20 18:44:33,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {445#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {445#false} is VALID [2022-02-20 18:44:33,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {445#false} assume main_~node3__m3~3#1 != ~nomsg~0; {445#false} is VALID [2022-02-20 18:44:33,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {445#false} assume !(0 == ~alive3~0 % 256); {445#false} is VALID [2022-02-20 18:44:33,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {445#false} assume !(main_~node3__m3~3#1 > ~id3~0); {445#false} is VALID [2022-02-20 18:44:33,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {445#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {445#false} is VALID [2022-02-20 18:44:33,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {445#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7340~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7340~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {445#false} is VALID [2022-02-20 18:44:33,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {445#false} assume 0 == main_~assert__arg~5#1 % 256; {445#false} is VALID [2022-02-20 18:44:33,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {445#false} assume !false; {445#false} is VALID [2022-02-20 18:44:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:33,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:33,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080196460] [2022-02-20 18:44:33,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080196460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:33,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:33,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:33,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539738995] [2022-02-20 18:44:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:33,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:33,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:33,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:33,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:33,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:33,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:33,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:33,948 INFO L87 Difference]: Start difference. First operand has 441 states, 436 states have (on average 1.8577981651376148) internal successors, (810), 440 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:34,922 INFO L93 Difference]: Finished difference Result 689 states and 1213 transitions. [2022-02-20 18:44:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:34,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2022-02-20 18:44:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2022-02-20 18:44:34,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1213 transitions. [2022-02-20 18:44:35,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1213 edges. 1213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:35,985 INFO L225 Difference]: With dead ends: 689 [2022-02-20 18:44:35,986 INFO L226 Difference]: Without dead ends: 545 [2022-02-20 18:44:35,989 INFO L932 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 [2022-02-20 18:44:35,996 INFO L933 BasicCegarLoop]: 831 mSDtfsCounter, 422 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:35,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 1356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-02-20 18:44:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 539. [2022-02-20 18:44:36,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:36,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 545 states. Second operand has 539 states, 535 states have (on average 1.3420560747663552) internal successors, (718), 538 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,074 INFO L74 IsIncluded]: Start isIncluded. First operand 545 states. Second operand has 539 states, 535 states have (on average 1.3420560747663552) internal successors, (718), 538 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,075 INFO L87 Difference]: Start difference. First operand 545 states. Second operand has 539 states, 535 states have (on average 1.3420560747663552) internal successors, (718), 538 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:36,100 INFO L93 Difference]: Finished difference Result 545 states and 722 transitions. [2022-02-20 18:44:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 722 transitions. [2022-02-20 18:44:36,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:36,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:36,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 535 states have (on average 1.3420560747663552) internal successors, (718), 538 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 545 states. [2022-02-20 18:44:36,106 INFO L87 Difference]: Start difference. First operand has 539 states, 535 states have (on average 1.3420560747663552) internal successors, (718), 538 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 545 states. [2022-02-20 18:44:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:36,129 INFO L93 Difference]: Finished difference Result 545 states and 722 transitions. [2022-02-20 18:44:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 722 transitions. [2022-02-20 18:44:36,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:36,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:36,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:36,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 535 states have (on average 1.3420560747663552) internal successors, (718), 538 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 718 transitions. [2022-02-20 18:44:36,158 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 718 transitions. Word has length 49 [2022-02-20 18:44:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:36,158 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 718 transitions. [2022-02-20 18:44:36,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 718 transitions. [2022-02-20 18:44:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:44:36,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:36,161 INFO L514 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] [2022-02-20 18:44:36,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:44:36,161 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash 969247668, now seen corresponding path program 1 times [2022-02-20 18:44:36,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:36,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118253324] [2022-02-20 18:44:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:36,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {2992#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {2992#true} is VALID [2022-02-20 18:44:36,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {2992#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {2992#true} is VALID [2022-02-20 18:44:36,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {2992#true} assume 0 == ~r1~0 % 256; {2992#true} is VALID [2022-02-20 18:44:36,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {2992#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {2992#true} is VALID [2022-02-20 18:44:36,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {2992#true} assume ~id1~0 >= 0; {2992#true} is VALID [2022-02-20 18:44:36,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {2992#true} assume 0 == ~st1~0; {2992#true} is VALID [2022-02-20 18:44:36,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {2992#true} assume ~send1~0 == ~id1~0; {2992#true} is VALID [2022-02-20 18:44:36,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {2992#true} assume 0 == ~mode1~0 % 256; {2992#true} is VALID [2022-02-20 18:44:36,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {2992#true} assume ~id2~0 >= 0; {2992#true} is VALID [2022-02-20 18:44:36,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {2992#true} assume 0 == ~st2~0; {2992#true} is VALID [2022-02-20 18:44:36,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {2992#true} assume ~send2~0 == ~id2~0; {2992#true} is VALID [2022-02-20 18:44:36,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {2992#true} assume 0 == ~mode2~0 % 256; {2992#true} is VALID [2022-02-20 18:44:36,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {2992#true} assume ~id3~0 >= 0; {2992#true} is VALID [2022-02-20 18:44:36,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#true} assume 0 == ~st3~0; {2992#true} is VALID [2022-02-20 18:44:36,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {2992#true} assume ~send3~0 == ~id3~0; {2992#true} is VALID [2022-02-20 18:44:36,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#true} assume 0 == ~mode3~0 % 256; {2992#true} is VALID [2022-02-20 18:44:36,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#true} assume ~id1~0 != ~id2~0; {2992#true} is VALID [2022-02-20 18:44:36,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#true} assume ~id1~0 != ~id3~0; {2992#true} is VALID [2022-02-20 18:44:36,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {2992#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {2992#true} is VALID [2022-02-20 18:44:36,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2992#true} is VALID [2022-02-20 18:44:36,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#true} assume !!(0 == ~mode1~0 % 256); {2992#true} is VALID [2022-02-20 18:44:36,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {2992#true} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~16#1;main_~node3__m3~16#1 := ~nomsg~0; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~56#1; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~56#1 := 1;~__return_8127~0 := main_~check__tmp~56#1;main_~main__c1~0#1 := ~__return_8127~0;havoc main_~__tmp_56~0#1;main_~__tmp_56~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~55#1;main_~assert__arg~55#1 := main_~__tmp_56~0#1; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == main_~assert__arg~55#1 % 256); {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~mode1~0 % 256); {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:36,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {2994#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {2993#false} is VALID [2022-02-20 18:44:36,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {2993#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2993#false} is VALID [2022-02-20 18:44:36,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {2993#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {2993#false} is VALID [2022-02-20 18:44:36,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {2993#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2993#false} is VALID [2022-02-20 18:44:36,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {2993#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {2993#false} is VALID [2022-02-20 18:44:36,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {2993#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {2993#false} is VALID [2022-02-20 18:44:36,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {2993#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2993#false} is VALID [2022-02-20 18:44:36,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {2993#false} assume main_~node3__m3~4#1 != ~nomsg~0; {2993#false} is VALID [2022-02-20 18:44:36,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {2993#false} assume !(0 == ~alive3~0 % 256); {2993#false} is VALID [2022-02-20 18:44:36,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {2993#false} assume !(main_~node3__m3~4#1 > ~id3~0); {2993#false} is VALID [2022-02-20 18:44:36,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {2993#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {2993#false} is VALID [2022-02-20 18:44:36,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {2993#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_6658~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_6658~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {2993#false} is VALID [2022-02-20 18:44:36,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {2993#false} assume 0 == main_~assert__arg~7#1 % 256; {2993#false} is VALID [2022-02-20 18:44:36,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {2993#false} assume !false; {2993#false} is VALID [2022-02-20 18:44:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:36,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:36,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118253324] [2022-02-20 18:44:36,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118253324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:36,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:36,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:36,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666828994] [2022-02-20 18:44:36,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:36,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:36,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:36,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:36,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:36,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:36,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:36,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:36,317 INFO L87 Difference]: Start difference. First operand 539 states and 718 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,017 INFO L93 Difference]: Finished difference Result 954 states and 1328 transitions. [2022-02-20 18:44:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:37,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2022-02-20 18:44:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2022-02-20 18:44:37,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 929 transitions. [2022-02-20 18:44:37,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 929 edges. 929 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:37,726 INFO L225 Difference]: With dead ends: 954 [2022-02-20 18:44:37,727 INFO L226 Difference]: Without dead ends: 713 [2022-02-20 18:44:37,728 INFO L932 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 [2022-02-20 18:44:37,729 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 238 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:37,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 1022 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-02-20 18:44:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 707. [2022-02-20 18:44:37,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:37,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 713 states. Second operand has 707 states, 703 states have (on average 1.3655761024182076) internal successors, (960), 706 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,761 INFO L74 IsIncluded]: Start isIncluded. First operand 713 states. Second operand has 707 states, 703 states have (on average 1.3655761024182076) internal successors, (960), 706 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,762 INFO L87 Difference]: Start difference. First operand 713 states. Second operand has 707 states, 703 states have (on average 1.3655761024182076) internal successors, (960), 706 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,792 INFO L93 Difference]: Finished difference Result 713 states and 964 transitions. [2022-02-20 18:44:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 964 transitions. [2022-02-20 18:44:37,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:37,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:37,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 703 states have (on average 1.3655761024182076) internal successors, (960), 706 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 713 states. [2022-02-20 18:44:37,796 INFO L87 Difference]: Start difference. First operand has 707 states, 703 states have (on average 1.3655761024182076) internal successors, (960), 706 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 713 states. [2022-02-20 18:44:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,825 INFO L93 Difference]: Finished difference Result 713 states and 964 transitions. [2022-02-20 18:44:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 964 transitions. [2022-02-20 18:44:37,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:37,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:37,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:37,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 703 states have (on average 1.3655761024182076) internal successors, (960), 706 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 960 transitions. [2022-02-20 18:44:37,862 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 960 transitions. Word has length 49 [2022-02-20 18:44:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:37,863 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 960 transitions. [2022-02-20 18:44:37,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 960 transitions. [2022-02-20 18:44:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:44:37,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:37,865 INFO L514 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] [2022-02-20 18:44:37,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:44:37,865 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash 533282259, now seen corresponding path program 1 times [2022-02-20 18:44:37,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:37,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340080795] [2022-02-20 18:44:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:37,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {6454#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {6454#true} is VALID [2022-02-20 18:44:37,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {6454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {6454#true} is VALID [2022-02-20 18:44:37,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {6454#true} assume 0 == ~r1~0 % 256; {6454#true} is VALID [2022-02-20 18:44:37,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {6454#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {6454#true} is VALID [2022-02-20 18:44:37,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {6454#true} assume ~id1~0 >= 0; {6454#true} is VALID [2022-02-20 18:44:37,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {6454#true} assume 0 == ~st1~0; {6454#true} is VALID [2022-02-20 18:44:37,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {6454#true} assume ~send1~0 == ~id1~0; {6454#true} is VALID [2022-02-20 18:44:37,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {6454#true} assume 0 == ~mode1~0 % 256; {6454#true} is VALID [2022-02-20 18:44:37,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {6454#true} assume ~id2~0 >= 0; {6454#true} is VALID [2022-02-20 18:44:37,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {6454#true} assume 0 == ~st2~0; {6454#true} is VALID [2022-02-20 18:44:37,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {6454#true} assume ~send2~0 == ~id2~0; {6454#true} is VALID [2022-02-20 18:44:37,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {6454#true} assume 0 == ~mode2~0 % 256; {6454#true} is VALID [2022-02-20 18:44:37,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {6454#true} assume ~id3~0 >= 0; {6454#true} is VALID [2022-02-20 18:44:37,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {6454#true} assume 0 == ~st3~0; {6454#true} is VALID [2022-02-20 18:44:37,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {6454#true} assume ~send3~0 == ~id3~0; {6454#true} is VALID [2022-02-20 18:44:37,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {6454#true} assume 0 == ~mode3~0 % 256; {6454#true} is VALID [2022-02-20 18:44:37,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {6454#true} assume ~id1~0 != ~id2~0; {6454#true} is VALID [2022-02-20 18:44:37,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {6454#true} assume ~id1~0 != ~id3~0; {6454#true} is VALID [2022-02-20 18:44:37,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {6454#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {6454#true} is VALID [2022-02-20 18:44:37,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {6454#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6454#true} is VALID [2022-02-20 18:44:37,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {6454#true} assume !!(0 == ~mode1~0 % 256); {6454#true} is VALID [2022-02-20 18:44:37,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {6454#true} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {6454#true} is VALID [2022-02-20 18:44:37,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {6454#true} assume !!(0 == ~mode2~0 % 256); {6454#true} is VALID [2022-02-20 18:44:37,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {6454#true} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {6454#true} is VALID [2022-02-20 18:44:37,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {6454#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~3#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~3#1 % 256 else main_~node2____CPAchecker_TMP_0~3#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~14#1;main_~node3__m3~14#1 := ~nomsg~0; {6454#true} is VALID [2022-02-20 18:44:37,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {6454#true} assume !!(0 == ~mode3~0 % 256); {6454#true} is VALID [2022-02-20 18:44:37,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {6454#true} assume !!(0 == ~alive3~0 % 256); {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~48#1; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~48#1 := 1;~__return_7858~0 := main_~check__tmp~48#1;main_~main__c1~0#1 := ~__return_7858~0;havoc main_~__tmp_48~0#1;main_~__tmp_48~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~47#1;main_~assert__arg~47#1 := main_~__tmp_48~0#1; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == main_~assert__arg~47#1 % 256); {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode1~0 % 256); {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive2~0 % 256); {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~3#1 != ~nomsg~0; {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:37,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {6456#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {6455#false} is VALID [2022-02-20 18:44:37,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {6455#false} assume !(main_~node3__m3~3#1 > ~id3~0); {6455#false} is VALID [2022-02-20 18:44:37,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {6455#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {6455#false} is VALID [2022-02-20 18:44:37,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {6455#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7340~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7340~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {6455#false} is VALID [2022-02-20 18:44:37,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {6455#false} assume 0 == main_~assert__arg~5#1 % 256; {6455#false} is VALID [2022-02-20 18:44:37,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {6455#false} assume !false; {6455#false} is VALID [2022-02-20 18:44:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:37,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:37,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340080795] [2022-02-20 18:44:37,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340080795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:37,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:37,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:37,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386428140] [2022-02-20 18:44:37,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:37,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:37,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:38,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:38,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:38,022 INFO L87 Difference]: Start difference. First operand 707 states and 960 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:38,812 INFO L93 Difference]: Finished difference Result 1363 states and 1911 transitions. [2022-02-20 18:44:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:38,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2022-02-20 18:44:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2022-02-20 18:44:38,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 901 transitions. [2022-02-20 18:44:39,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 901 edges. 901 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:39,525 INFO L225 Difference]: With dead ends: 1363 [2022-02-20 18:44:39,526 INFO L226 Difference]: Without dead ends: 1034 [2022-02-20 18:44:39,526 INFO L932 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 [2022-02-20 18:44:39,527 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 299 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:39,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 997 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-02-20 18:44:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1027. [2022-02-20 18:44:39,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:39,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1034 states. Second operand has 1027 states, 1023 states have (on average 1.380254154447703) internal successors, (1412), 1026 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,568 INFO L74 IsIncluded]: Start isIncluded. First operand 1034 states. Second operand has 1027 states, 1023 states have (on average 1.380254154447703) internal successors, (1412), 1026 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,571 INFO L87 Difference]: Start difference. First operand 1034 states. Second operand has 1027 states, 1023 states have (on average 1.380254154447703) internal successors, (1412), 1026 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:39,627 INFO L93 Difference]: Finished difference Result 1034 states and 1417 transitions. [2022-02-20 18:44:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1417 transitions. [2022-02-20 18:44:39,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:39,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:39,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 1027 states, 1023 states have (on average 1.380254154447703) internal successors, (1412), 1026 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1034 states. [2022-02-20 18:44:39,634 INFO L87 Difference]: Start difference. First operand has 1027 states, 1023 states have (on average 1.380254154447703) internal successors, (1412), 1026 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1034 states. [2022-02-20 18:44:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:39,690 INFO L93 Difference]: Finished difference Result 1034 states and 1417 transitions. [2022-02-20 18:44:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1417 transitions. [2022-02-20 18:44:39,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:39,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:39,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:39,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1023 states have (on average 1.380254154447703) internal successors, (1412), 1026 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1412 transitions. [2022-02-20 18:44:39,764 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1412 transitions. Word has length 49 [2022-02-20 18:44:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:39,765 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1412 transitions. [2022-02-20 18:44:39,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1412 transitions. [2022-02-20 18:44:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:44:39,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:39,767 INFO L514 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] [2022-02-20 18:44:39,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:44:39,767 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash 388998377, now seen corresponding path program 1 times [2022-02-20 18:44:39,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:39,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14625940] [2022-02-20 18:44:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:39,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {11542#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {11544#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:39,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {11544#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {11545#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:39,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {11545#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {11545#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:39,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {11545#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {11546#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:39,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {11546#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~3#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~3#1 % 256 else main_~node2____CPAchecker_TMP_0~3#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~14#1;main_~node3__m3~14#1 := ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {11543#false} assume !!(0 == ~mode3~0 % 256); {11543#false} is VALID [2022-02-20 18:44:39,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {11543#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~10#1; {11543#false} is VALID [2022-02-20 18:44:39,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {11543#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~10#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~10#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~10#1 % 256 else main_~node3____CPAchecker_TMP_0~10#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~46#1; {11543#false} is VALID [2022-02-20 18:44:39,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {11543#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11543#false} is VALID [2022-02-20 18:44:39,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {11543#false} assume ~r1~0 % 256 < 3;main_~check__tmp~46#1 := 1;~__return_7801~0 := main_~check__tmp~46#1;main_~main__c1~0#1 := ~__return_7801~0;havoc main_~__tmp_46~0#1;main_~__tmp_46~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~45#1;main_~assert__arg~45#1 := main_~__tmp_46~0#1; {11543#false} is VALID [2022-02-20 18:44:39,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {11543#false} assume !(0 == main_~assert__arg~45#1 % 256); {11543#false} is VALID [2022-02-20 18:44:39,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {11543#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {11543#false} assume !(0 == ~mode1~0 % 256); {11543#false} is VALID [2022-02-20 18:44:39,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {11543#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {11543#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {11543#false} is VALID [2022-02-20 18:44:39,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {11543#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {11543#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {11543#false} assume main_~node2__m2~1#1 != ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {11543#false} assume !(0 == ~alive2~0 % 256); {11543#false} is VALID [2022-02-20 18:44:39,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {11543#false} assume !(main_~node2__m2~1#1 > ~id2~0); {11543#false} is VALID [2022-02-20 18:44:39,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {11543#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {11543#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {11543#false} assume main_~node3__m3~3#1 != ~nomsg~0; {11543#false} is VALID [2022-02-20 18:44:39,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {11543#false} assume !(0 == ~alive3~0 % 256); {11543#false} is VALID [2022-02-20 18:44:39,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {11543#false} assume !(main_~node3__m3~3#1 > ~id3~0); {11543#false} is VALID [2022-02-20 18:44:39,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {11543#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {11543#false} is VALID [2022-02-20 18:44:39,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {11543#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7340~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7340~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {11543#false} is VALID [2022-02-20 18:44:39,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {11543#false} assume 0 == main_~assert__arg~5#1 % 256; {11543#false} is VALID [2022-02-20 18:44:39,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {11543#false} assume !false; {11543#false} is VALID [2022-02-20 18:44:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:39,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:39,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14625940] [2022-02-20 18:44:39,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14625940] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:39,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:39,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:39,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500960524] [2022-02-20 18:44:39,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:39,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:39,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:39,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:39,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:39,939 INFO L87 Difference]: Start difference. First operand 1027 states and 1412 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:41,855 INFO L93 Difference]: Finished difference Result 2116 states and 2959 transitions. [2022-02-20 18:44:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:41,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:44:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1002 transitions. [2022-02-20 18:44:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1002 transitions. [2022-02-20 18:44:41,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1002 transitions. [2022-02-20 18:44:42,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1002 edges. 1002 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:42,669 INFO L225 Difference]: With dead ends: 2116 [2022-02-20 18:44:42,669 INFO L226 Difference]: Without dead ends: 1254 [2022-02-20 18:44:42,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:42,671 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 1692 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:42,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1692 Valid, 403 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:44:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-02-20 18:44:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1244. [2022-02-20 18:44:43,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:43,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1254 states. Second operand has 1244 states, 1240 states have (on average 1.3935483870967742) internal successors, (1728), 1243 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,239 INFO L74 IsIncluded]: Start isIncluded. First operand 1254 states. Second operand has 1244 states, 1240 states have (on average 1.3935483870967742) internal successors, (1728), 1243 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,241 INFO L87 Difference]: Start difference. First operand 1254 states. Second operand has 1244 states, 1240 states have (on average 1.3935483870967742) internal successors, (1728), 1243 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,321 INFO L93 Difference]: Finished difference Result 1254 states and 1736 transitions. [2022-02-20 18:44:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1736 transitions. [2022-02-20 18:44:43,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:43,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:43,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 1244 states, 1240 states have (on average 1.3935483870967742) internal successors, (1728), 1243 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1254 states. [2022-02-20 18:44:43,329 INFO L87 Difference]: Start difference. First operand has 1244 states, 1240 states have (on average 1.3935483870967742) internal successors, (1728), 1243 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1254 states. [2022-02-20 18:44:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,415 INFO L93 Difference]: Finished difference Result 1254 states and 1736 transitions. [2022-02-20 18:44:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1736 transitions. [2022-02-20 18:44:43,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:43,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:43,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:43,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1240 states have (on average 1.3935483870967742) internal successors, (1728), 1243 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1728 transitions. [2022-02-20 18:44:43,518 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1728 transitions. Word has length 49 [2022-02-20 18:44:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:43,518 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 1728 transitions. [2022-02-20 18:44:43,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1728 transitions. [2022-02-20 18:44:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:44:43,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:43,521 INFO L514 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] [2022-02-20 18:44:43,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:44:43,521 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1582595724, now seen corresponding path program 1 times [2022-02-20 18:44:43,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:43,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290276920] [2022-02-20 18:44:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:43,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {18380#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {18382#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:43,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {18382#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {18382#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:43,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {18382#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {18382#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:43,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {18382#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {18382#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:43,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {18382#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {18383#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:43,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {18383#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {18383#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:43,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {18383#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:43,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {18384#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {18381#false} assume !!(0 == ~mode2~0 % 256); {18381#false} is VALID [2022-02-20 18:44:43,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {18381#false} assume !!(0 == ~alive2~0 % 256); {18381#false} is VALID [2022-02-20 18:44:43,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {18381#false} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {18381#false} assume !!(0 == ~mode3~0 % 256); {18381#false} is VALID [2022-02-20 18:44:43,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {18381#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~8#1; {18381#false} is VALID [2022-02-20 18:44:43,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {18381#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~8#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~8#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~8#1 % 256 else main_~node3____CPAchecker_TMP_0~8#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~38#1; {18381#false} is VALID [2022-02-20 18:44:43,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {18381#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18381#false} is VALID [2022-02-20 18:44:43,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#false} assume ~r1~0 % 256 < 3;main_~check__tmp~38#1 := 1;~__return_6768~0 := main_~check__tmp~38#1;main_~main__c1~0#1 := ~__return_6768~0;havoc main_~__tmp_38~0#1;main_~__tmp_38~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~37#1;main_~assert__arg~37#1 := main_~__tmp_38~0#1; {18381#false} is VALID [2022-02-20 18:44:43,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {18381#false} assume !(0 == main_~assert__arg~37#1 % 256); {18381#false} is VALID [2022-02-20 18:44:43,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {18381#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {18381#false} assume !(0 == ~mode1~0 % 256); {18381#false} is VALID [2022-02-20 18:44:43,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {18381#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {18381#false} assume main_~node1__m1~1#1 != ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {18381#false} assume !(0 == ~alive1~0 % 256); {18381#false} is VALID [2022-02-20 18:44:43,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {18381#false} assume !(main_~node1__m1~1#1 > ~id1~0); {18381#false} is VALID [2022-02-20 18:44:43,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {18381#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {18381#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {18381#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {18381#false} is VALID [2022-02-20 18:44:43,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {18381#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {18381#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {18381#false} assume main_~node3__m3~4#1 != ~nomsg~0; {18381#false} is VALID [2022-02-20 18:44:43,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {18381#false} assume !(0 == ~alive3~0 % 256); {18381#false} is VALID [2022-02-20 18:44:43,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {18381#false} assume !(main_~node3__m3~4#1 > ~id3~0); {18381#false} is VALID [2022-02-20 18:44:43,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {18381#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {18381#false} is VALID [2022-02-20 18:44:43,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {18381#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_6658~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_6658~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {18381#false} is VALID [2022-02-20 18:44:43,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {18381#false} assume 0 == main_~assert__arg~7#1 % 256; {18381#false} is VALID [2022-02-20 18:44:43,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {18381#false} assume !false; {18381#false} is VALID [2022-02-20 18:44:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:43,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:43,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290276920] [2022-02-20 18:44:43,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290276920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:43,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:43,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:43,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152251830] [2022-02-20 18:44:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:44:43,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:43,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:43,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:43,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:43,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:43,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:43,694 INFO L87 Difference]: Start difference. First operand 1244 states and 1728 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:46,181 INFO L93 Difference]: Finished difference Result 2642 states and 3721 transitions. [2022-02-20 18:44:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:46,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:44:46,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 844 transitions. [2022-02-20 18:44:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 844 transitions. [2022-02-20 18:44:46,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 844 transitions. [2022-02-20 18:44:46,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 844 edges. 844 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:46,906 INFO L225 Difference]: With dead ends: 2642 [2022-02-20 18:44:46,907 INFO L226 Difference]: Without dead ends: 1578 [2022-02-20 18:44:46,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:46,908 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1444 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:46,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1444 Valid, 346 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:44:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-02-20 18:44:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1176. [2022-02-20 18:44:47,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:47,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1578 states. Second operand has 1176 states, 1172 states have (on average 1.3933447098976108) internal successors, (1633), 1175 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:47,822 INFO L74 IsIncluded]: Start isIncluded. First operand 1578 states. Second operand has 1176 states, 1172 states have (on average 1.3933447098976108) internal successors, (1633), 1175 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:47,831 INFO L87 Difference]: Start difference. First operand 1578 states. Second operand has 1176 states, 1172 states have (on average 1.3933447098976108) internal successors, (1633), 1175 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:47,972 INFO L93 Difference]: Finished difference Result 1578 states and 2194 transitions. [2022-02-20 18:44:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2194 transitions. [2022-02-20 18:44:47,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:47,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:47,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 1176 states, 1172 states have (on average 1.3933447098976108) internal successors, (1633), 1175 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1578 states. [2022-02-20 18:44:47,982 INFO L87 Difference]: Start difference. First operand has 1176 states, 1172 states have (on average 1.3933447098976108) internal successors, (1633), 1175 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1578 states. [2022-02-20 18:44:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:48,084 INFO L93 Difference]: Finished difference Result 1578 states and 2194 transitions. [2022-02-20 18:44:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2194 transitions. [2022-02-20 18:44:48,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:48,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:48,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:48,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1172 states have (on average 1.3933447098976108) internal successors, (1633), 1175 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1633 transitions. [2022-02-20 18:44:48,179 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1633 transitions. Word has length 50 [2022-02-20 18:44:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:48,179 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1633 transitions. [2022-02-20 18:44:48,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1633 transitions. [2022-02-20 18:44:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:44:48,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:48,181 INFO L514 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] [2022-02-20 18:44:48,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:48,182 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1245141101, now seen corresponding path program 1 times [2022-02-20 18:44:48,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:48,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994963665] [2022-02-20 18:44:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:48,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {26554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {26556#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:48,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {26556#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {26557#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:48,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {26557#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {26557#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:48,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {26557#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~3#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~3#1 % 256 else main_~node2____CPAchecker_TMP_0~3#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~13#1;main_~node3__m3~13#1 := ~nomsg~0; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~9#1; {26558#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:48,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {26558#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~9#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~9#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~9#1 % 256 else main_~node3____CPAchecker_TMP_0~9#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~42#1; {26555#false} is VALID [2022-02-20 18:44:48,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {26555#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {26555#false} is VALID [2022-02-20 18:44:48,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {26555#false} assume ~r1~0 % 256 < 3;main_~check__tmp~42#1 := 1;~__return_7936~0 := main_~check__tmp~42#1;main_~main__c1~0#1 := ~__return_7936~0;havoc main_~__tmp_42~0#1;main_~__tmp_42~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~41#1;main_~assert__arg~41#1 := main_~__tmp_42~0#1; {26555#false} is VALID [2022-02-20 18:44:48,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {26555#false} assume !(0 == main_~assert__arg~41#1 % 256); {26555#false} is VALID [2022-02-20 18:44:48,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {26555#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {26555#false} assume !(0 == ~mode1~0 % 256); {26555#false} is VALID [2022-02-20 18:44:48,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {26555#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {26555#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {26555#false} is VALID [2022-02-20 18:44:48,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {26555#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {26555#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {26555#false} assume main_~node2__m2~1#1 != ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {26555#false} assume !(0 == ~alive2~0 % 256); {26555#false} is VALID [2022-02-20 18:44:48,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {26555#false} assume !(main_~node2__m2~1#1 > ~id2~0); {26555#false} is VALID [2022-02-20 18:44:48,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {26555#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {26555#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {26555#false} assume main_~node3__m3~3#1 != ~nomsg~0; {26555#false} is VALID [2022-02-20 18:44:48,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {26555#false} assume !(0 == ~alive3~0 % 256); {26555#false} is VALID [2022-02-20 18:44:48,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {26555#false} assume !(main_~node3__m3~3#1 > ~id3~0); {26555#false} is VALID [2022-02-20 18:44:48,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {26555#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {26555#false} is VALID [2022-02-20 18:44:48,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {26555#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7340~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7340~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {26555#false} is VALID [2022-02-20 18:44:48,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {26555#false} assume 0 == main_~assert__arg~5#1 % 256; {26555#false} is VALID [2022-02-20 18:44:48,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {26555#false} assume !false; {26555#false} is VALID [2022-02-20 18:44:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:48,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:48,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994963665] [2022-02-20 18:44:48,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994963665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:48,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:48,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:48,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857942824] [2022-02-20 18:44:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:48,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:44:48,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:48,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:48,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:48,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:48,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:48,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:48,345 INFO L87 Difference]: Start difference. First operand 1176 states and 1633 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:50,990 INFO L93 Difference]: Finished difference Result 2591 states and 3626 transitions. [2022-02-20 18:44:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:50,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:44:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2022-02-20 18:44:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2022-02-20 18:44:50,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 761 transitions. [2022-02-20 18:44:51,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 761 edges. 761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:51,704 INFO L225 Difference]: With dead ends: 2591 [2022-02-20 18:44:51,705 INFO L226 Difference]: Without dead ends: 1533 [2022-02-20 18:44:51,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:51,713 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1278 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:51,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1278 Valid, 320 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2022-02-20 18:44:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1520. [2022-02-20 18:44:53,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:53,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1533 states. Second operand has 1520 states, 1516 states have (on average 1.3885224274406331) internal successors, (2105), 1519 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,259 INFO L74 IsIncluded]: Start isIncluded. First operand 1533 states. Second operand has 1520 states, 1516 states have (on average 1.3885224274406331) internal successors, (2105), 1519 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,260 INFO L87 Difference]: Start difference. First operand 1533 states. Second operand has 1520 states, 1516 states have (on average 1.3885224274406331) internal successors, (2105), 1519 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:53,358 INFO L93 Difference]: Finished difference Result 1533 states and 2116 transitions. [2022-02-20 18:44:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2116 transitions. [2022-02-20 18:44:53,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:53,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:53,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 1520 states, 1516 states have (on average 1.3885224274406331) internal successors, (2105), 1519 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1533 states. [2022-02-20 18:44:53,363 INFO L87 Difference]: Start difference. First operand has 1520 states, 1516 states have (on average 1.3885224274406331) internal successors, (2105), 1519 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1533 states. [2022-02-20 18:44:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:53,438 INFO L93 Difference]: Finished difference Result 1533 states and 2116 transitions. [2022-02-20 18:44:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2116 transitions. [2022-02-20 18:44:53,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:53,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:53,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:53,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1516 states have (on average 1.3885224274406331) internal successors, (2105), 1519 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2105 transitions. [2022-02-20 18:44:53,545 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2105 transitions. Word has length 50 [2022-02-20 18:44:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:53,545 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 2105 transitions. [2022-02-20 18:44:53,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2105 transitions. [2022-02-20 18:44:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:53,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:53,547 INFO L514 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] [2022-02-20 18:44:53,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:53,547 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:53,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2025988922, now seen corresponding path program 1 times [2022-02-20 18:44:53,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:53,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847675254] [2022-02-20 18:44:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:53,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {35080#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {35082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {35082#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode2~0 % 256; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id3~0 >= 0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st3~0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send3~0 == ~id3~0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode3~0 % 256; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id2~0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id3~0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {35083#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {35083#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode1~0 % 256); {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode2~0 % 256); {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send2~0 != ~nomsg~0; {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~3#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~3#1 % 256 else main_~node2____CPAchecker_TMP_0~3#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~13#1;main_~node3__m3~13#1 := ~nomsg~0; {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode3~0 % 256); {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~9#1; {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send3~0 != ~nomsg~0; {35084#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {35084#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~9#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~9#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~9#1 % 256 else main_~node3____CPAchecker_TMP_0~9#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~41#1; {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~r1~0 % 256 < 3;main_~check__tmp~41#1 := 1;~__return_7965~0 := main_~check__tmp~41#1;main_~main__c1~0#1 := ~__return_7965~0;havoc main_~__tmp_41~0#1;main_~__tmp_41~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~40#1;main_~assert__arg~40#1 := main_~__tmp_41~0#1; {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == main_~assert__arg~40#1 % 256); {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode1~0 % 256); {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35085#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:53,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {35085#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:53,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 != ~nomsg~0; {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:53,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(0 == ~alive2~0 % 256); {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:53,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(main_~node2__m2~1#1 > ~id2~0); {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:53,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {35086#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {35081#false} is VALID [2022-02-20 18:44:53,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {35081#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35081#false} is VALID [2022-02-20 18:44:53,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {35081#false} assume main_~node3__m3~3#1 != ~nomsg~0; {35081#false} is VALID [2022-02-20 18:44:53,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {35081#false} assume !(0 == ~alive3~0 % 256); {35081#false} is VALID [2022-02-20 18:44:53,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {35081#false} assume !(main_~node3__m3~3#1 > ~id3~0); {35081#false} is VALID [2022-02-20 18:44:53,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {35081#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {35081#false} is VALID [2022-02-20 18:44:53,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {35081#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7340~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7340~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {35081#false} is VALID [2022-02-20 18:44:53,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {35081#false} assume 0 == main_~assert__arg~5#1 % 256; {35081#false} is VALID [2022-02-20 18:44:53,668 INFO L290 TraceCheckUtils]: 50: Hoare triple {35081#false} assume !false; {35081#false} is VALID [2022-02-20 18:44:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:53,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:53,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847675254] [2022-02-20 18:44:53,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847675254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:53,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:53,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:44:53,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242238646] [2022-02-20 18:44:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:53,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:53,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:53,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:53,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:53,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:44:53,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:53,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:44:53,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:53,709 INFO L87 Difference]: Start difference. First operand 1520 states and 2105 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:03,731 INFO L93 Difference]: Finished difference Result 4981 states and 7069 transitions. [2022-02-20 18:45:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:45:03,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:45:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1026 transitions. [2022-02-20 18:45:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1026 transitions. [2022-02-20 18:45:03,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1026 transitions. [2022-02-20 18:45:04,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1026 edges. 1026 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:05,274 INFO L225 Difference]: With dead ends: 4981 [2022-02-20 18:45:05,275 INFO L226 Difference]: Without dead ends: 4548 [2022-02-20 18:45:05,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:45:05,277 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 3000 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:05,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3000 Valid, 633 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:45:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2022-02-20 18:45:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 1532. [2022-02-20 18:45:07,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:07,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4548 states. Second operand has 1532 states, 1528 states have (on average 1.388089005235602) internal successors, (2121), 1531 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,420 INFO L74 IsIncluded]: Start isIncluded. First operand 4548 states. Second operand has 1532 states, 1528 states have (on average 1.388089005235602) internal successors, (2121), 1531 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,421 INFO L87 Difference]: Start difference. First operand 4548 states. Second operand has 1532 states, 1528 states have (on average 1.388089005235602) internal successors, (2121), 1531 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:08,065 INFO L93 Difference]: Finished difference Result 4548 states and 6456 transitions. [2022-02-20 18:45:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6456 transitions. [2022-02-20 18:45:08,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:08,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:08,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 1532 states, 1528 states have (on average 1.388089005235602) internal successors, (2121), 1531 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4548 states. [2022-02-20 18:45:08,075 INFO L87 Difference]: Start difference. First operand has 1532 states, 1528 states have (on average 1.388089005235602) internal successors, (2121), 1531 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4548 states. [2022-02-20 18:45:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:08,699 INFO L93 Difference]: Finished difference Result 4548 states and 6456 transitions. [2022-02-20 18:45:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6456 transitions. [2022-02-20 18:45:08,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:08,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:08,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:08,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1528 states have (on average 1.388089005235602) internal successors, (2121), 1531 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2121 transitions. [2022-02-20 18:45:08,846 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2121 transitions. Word has length 51 [2022-02-20 18:45:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:08,846 INFO L470 AbstractCegarLoop]: Abstraction has 1532 states and 2121 transitions. [2022-02-20 18:45:08,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2121 transitions. [2022-02-20 18:45:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:45:08,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:08,847 INFO L514 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] [2022-02-20 18:45:08,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:45:08,848 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:45:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1769009660, now seen corresponding path program 1 times [2022-02-20 18:45:08,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:08,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436551026] [2022-02-20 18:45:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:08,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:08,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {53168#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_5979~0 := 0;~__return_7374~0 := 0;~__return_6118~0 := 0;~__return_6185~0 := 0;~__return_6587~0 := 0;~__return_7109~0 := 0;~__return_7340~0 := 0;~__return_6415~0 := 0;~__return_6658~0 := 0;~__return_7192~0 := 0;~__return_7411~0 := 0;~__return_7303~0 := 0;~__return_7469~0 := 0;~__return_7438~0 := 0;~__return_7143~0 := 0;~__return_7058~0 := 0;~__return_7256~0 := 0;~__return_7225~0 := 0;~__return_7681~0 := 0;~__return_7652~0 := 0;~__return_7740~0 := 0;~__return_7709~0 := 0;~__return_7544~0 := 0;~__return_7515~0 := 0;~__return_7603~0 := 0;~__return_7572~0 := 0;~__return_6621~0 := 0;~__return_6548~0 := 0;~__return_6722~0 := 0;~__return_6691~0 := 0;~__return_6352~0 := 0;~__return_6057~0 := 0;~__return_6501~0 := 0;~__return_6470~0 := 0;~__return_6934~0 := 0;~__return_6905~0 := 0;~__return_6993~0 := 0;~__return_6962~0 := 0;~__return_6797~0 := 0;~__return_6768~0 := 0;~__return_6856~0 := 0;~__return_6825~0 := 0;~__return_7965~0 := 0;~__return_7936~0 := 0;~__return_8024~0 := 0;~__return_7993~0 := 0;~__return_7830~0 := 0;~__return_7801~0 := 0;~__return_7889~0 := 0;~__return_7858~0 := 0;~__return_8236~0 := 0;~__return_8207~0 := 0;~__return_8295~0 := 0;~__return_8264~0 := 0;~__return_8099~0 := 0;~__return_8070~0 := 0;~__return_8158~0 := 0;~__return_8127~0 := 0; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {53170#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:08,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {53170#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {53171#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {53171#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {53171#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {53171#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {53171#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {53171#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~mode3~0 % 256; {53171#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {53171#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id2~0; {53171#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {53171#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id3~0; {53171#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {53171#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_5979~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_5979~0; {53171#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {53171#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode1~0 % 256); {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send1~0 != ~nomsg~0; {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode2~0 % 256); {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~alive2~0 % 256); {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode3~0 % 256); {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send3~0 != ~nomsg~0; {53172#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {53172#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~4#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~21#1; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~r1~0 % 256 < 3;main_~check__tmp~21#1 := 1;~__return_7544~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_7544~0;havoc main_~__tmp_21~0#1;main_~__tmp_21~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~20#1;main_~assert__arg~20#1 := main_~__tmp_21~0#1; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == main_~assert__arg~20#1 % 256); {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode1~0 % 256); {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256); {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {53173#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:08,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {53173#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:08,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:08,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(0 == ~alive3~0 % 256); {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:08,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(main_~node3__m3~4#1 > ~id3~0); {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:08,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {53174#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {53169#false} is VALID [2022-02-20 18:45:08,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {53169#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_6658~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_6658~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {53169#false} is VALID [2022-02-20 18:45:08,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {53169#false} assume 0 == main_~assert__arg~7#1 % 256; {53169#false} is VALID [2022-02-20 18:45:08,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {53169#false} assume !false; {53169#false} is VALID [2022-02-20 18:45:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:08,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:08,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436551026] [2022-02-20 18:45:08,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436551026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:08,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:08,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:45:08,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632085719] [2022-02-20 18:45:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:08,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:08,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:08,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:45:08,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:08,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:45:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:45:08,986 INFO L87 Difference]: Start difference. First operand 1532 states and 2121 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:21,070 INFO L93 Difference]: Finished difference Result 5316 states and 7567 transitions. [2022-02-20 18:45:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:45:21,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 898 transitions. [2022-02-20 18:45:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 898 transitions. [2022-02-20 18:45:21,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 898 transitions. [2022-02-20 18:45:21,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 898 edges. 898 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:22,581 INFO L225 Difference]: With dead ends: 5316 [2022-02-20 18:45:22,581 INFO L226 Difference]: Without dead ends: 4768 [2022-02-20 18:45:22,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:45:22,583 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 1905 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:22,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1905 Valid, 726 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:45:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2022-02-20 18:45:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 1554. [2022-02-20 18:45:25,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:25,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4768 states. Second operand has 1554 states, 1550 states have (on average 1.3883870967741936) internal successors, (2152), 1553 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:25,294 INFO L74 IsIncluded]: Start isIncluded. First operand 4768 states. Second operand has 1554 states, 1550 states have (on average 1.3883870967741936) internal successors, (2152), 1553 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:25,296 INFO L87 Difference]: Start difference. First operand 4768 states. Second operand has 1554 states, 1550 states have (on average 1.3883870967741936) internal successors, (2152), 1553 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)