./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.BOUNDED-6.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.BOUNDED-6.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 b13c8169fb5357220d29959d63393b66877a012797fdaa495805bf5299de8fb1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:44:06,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:44:06,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:44:06,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:44:06,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:44:06,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:44:06,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:44:06,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:44:06,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:44:06,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:44:06,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:44:06,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:44:06,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:44:06,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:44:06,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:44:06,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:44:06,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:44:06,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:44:06,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:44:06,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:44:06,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:44:06,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:44:06,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:44:06,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:44:06,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:44:06,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:44:06,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:44:06,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:44:06,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:44:06,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:44:06,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:44:06,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:44:06,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:44:06,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:44:06,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:44:06,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:44:06,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:44:06,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:44:06,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:44:06,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:44:06,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:44:06,096 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:06,121 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:44:06,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:44:06,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:44:06,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:44:06,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:44:06,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:44:06,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:44:06,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:44:06,125 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:44:06,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:44:06,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:44:06,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:44:06,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:44:06,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:44:06,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:44:06,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:44:06,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:44:06,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:44:06,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:44:06,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:44:06,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:44:06,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:44:06,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:44:06,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:44:06,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:06,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:44:06,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:44:06,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:44:06,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:44:06,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:44:06,130 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:44:06,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:44:06,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:44:06,130 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 -> b13c8169fb5357220d29959d63393b66877a012797fdaa495805bf5299de8fb1 [2022-02-20 18:44:06,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:44:06,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:44:06,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:44:06,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:44:06,346 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:44:06,347 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.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:44:06,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa39cb13c/c6ba62ac649e4aa4a18811c99a07f5b1/FLAG41ba3f4b5 [2022-02-20 18:44:06,850 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:44:06,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:44:06,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa39cb13c/c6ba62ac649e4aa4a18811c99a07f5b1/FLAG41ba3f4b5 [2022-02-20 18:44:06,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa39cb13c/c6ba62ac649e4aa4a18811c99a07f5b1 [2022-02-20 18:44:06,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:44:06,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:44:06,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:06,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:44:06,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:44:06,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:06" (1/1) ... [2022-02-20 18:44:06,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57eac693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:06, skipping insertion in model container [2022-02-20 18:44:06,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:06" (1/1) ... [2022-02-20 18:44:06,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:44:06,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:44:07,154 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.BOUNDED-6.pals.c.v+lhb-reducer.c[8622,8635] [2022-02-20 18:44:07,185 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.BOUNDED-6.pals.c.v+lhb-reducer.c[15089,15102] [2022-02-20 18:44:07,202 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.BOUNDED-6.pals.c.v+lhb-reducer.c[17286,17299] [2022-02-20 18:44:07,206 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.BOUNDED-6.pals.c.v+lhb-reducer.c[18310,18323] [2022-02-20 18:44:07,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:07,330 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:44:07,371 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.BOUNDED-6.pals.c.v+lhb-reducer.c[8622,8635] [2022-02-20 18:44:07,381 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.BOUNDED-6.pals.c.v+lhb-reducer.c[15089,15102] [2022-02-20 18:44:07,396 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.BOUNDED-6.pals.c.v+lhb-reducer.c[17286,17299] [2022-02-20 18:44:07,398 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.BOUNDED-6.pals.c.v+lhb-reducer.c[18310,18323] [2022-02-20 18:44:07,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:07,520 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:44:07,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:07 WrapperNode [2022-02-20 18:44:07,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:07,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:07,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:44:07,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:44:07,529 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:07" (1/1) ... [2022-02-20 18:44:07,563 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:07" (1/1) ... [2022-02-20 18:44:07,652 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2551 [2022-02-20 18:44:07,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:07,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:44:07,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:44:07,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:44:07,662 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:07" (1/1) ... [2022-02-20 18:44:07,663 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:07" (1/1) ... [2022-02-20 18:44:07,671 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:07" (1/1) ... [2022-02-20 18:44:07,671 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:07" (1/1) ... [2022-02-20 18:44:07,704 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:07" (1/1) ... [2022-02-20 18:44:07,713 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:07" (1/1) ... [2022-02-20 18:44:07,716 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:07" (1/1) ... [2022-02-20 18:44:07,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:44:07,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:44:07,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:44:07,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:44:07,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:07" (1/1) ... [2022-02-20 18:44:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:07,750 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:07,765 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:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:44:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:44:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:44:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:44:07,920 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:44:07,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:44:09,194 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:44:09,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:44:09,202 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:44:09,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:09 BoogieIcfgContainer [2022-02-20 18:44:09,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:44:09,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:44:09,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:44:09,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:44:09,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:44:06" (1/3) ... [2022-02-20 18:44:09,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670a31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:09, skipping insertion in model container [2022-02-20 18:44:09,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:07" (2/3) ... [2022-02-20 18:44:09,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670a31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:09, skipping insertion in model container [2022-02-20 18:44:09,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:09" (3/3) ... [2022-02-20 18:44:09,209 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:44:09,212 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:44:09,212 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 18:44:09,239 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:44:09,243 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:09,243 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 18:44:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 442 states, 437 states have (on average 1.8581235697940504) internal successors, (812), 441 states have internal predecessors, (812), 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:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:44:09,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:09,268 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:09,268 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:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 881754525, now seen corresponding path program 1 times [2022-02-20 18:44:09,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:09,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569000531] [2022-02-20 18:44:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:09,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {445#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {445#true} is VALID [2022-02-20 18:44:09,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {445#true} is VALID [2022-02-20 18:44:09,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {445#true} assume 0 == ~r1~0; {445#true} is VALID [2022-02-20 18:44:09,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {445#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {445#true} is VALID [2022-02-20 18:44:09,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {445#true} assume ~id1~0 >= 0; {445#true} is VALID [2022-02-20 18:44:09,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} assume 0 == ~st1~0; {445#true} is VALID [2022-02-20 18:44:09,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#true} assume ~send1~0 == ~id1~0; {445#true} is VALID [2022-02-20 18:44:09,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#true} assume 0 == ~mode1~0 % 256; {445#true} is VALID [2022-02-20 18:44:09,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#true} assume ~id2~0 >= 0; {445#true} is VALID [2022-02-20 18:44:09,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {445#true} assume 0 == ~st2~0; {445#true} is VALID [2022-02-20 18:44:09,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#true} assume ~send2~0 == ~id2~0; {445#true} is VALID [2022-02-20 18:44:09,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#true} assume 0 == ~mode2~0 % 256; {445#true} is VALID [2022-02-20 18:44:09,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#true} assume ~id3~0 >= 0; {445#true} is VALID [2022-02-20 18:44:09,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {445#true} assume 0 == ~st3~0; {445#true} is VALID [2022-02-20 18:44:09,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {445#true} assume ~send3~0 == ~id3~0; {445#true} is VALID [2022-02-20 18:44:09,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#true} assume 0 == ~mode3~0 % 256; {445#true} is VALID [2022-02-20 18:44:09,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#true} assume ~id1~0 != ~id2~0; {445#true} is VALID [2022-02-20 18:44:09,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {445#true} assume ~id1~0 != ~id3~0; {445#true} is VALID [2022-02-20 18:44:09,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {445#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {445#true} is VALID [2022-02-20 18:44:09,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {445#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; {445#true} is VALID [2022-02-20 18:44:09,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {445#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {445#true} is VALID [2022-02-20 18:44:09,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {445#true} assume !!(0 == ~mode1~0 % 256); {445#true} is VALID [2022-02-20 18:44:09,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {445#true} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {445#true} is VALID [2022-02-20 18:44:09,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {445#true} assume !!(0 == ~mode2~0 % 256); {445#true} is VALID [2022-02-20 18:44:09,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {445#true} assume !!(0 == ~alive2~0 % 256); {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {447#(= (+ (* (- 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; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {447#(= (+ (* (- 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; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~56#1 := 1;~__return_8349~0 := main_~check__tmp~56#1;main_~main__c1~0#1 := ~__return_8349~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; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == main_~assert__arg~55#1 % 256);main_~main____CPAchecker_TMP_0~52#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~52#1; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {447#(= (+ (* (- 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; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:09,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {447#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {446#false} is VALID [2022-02-20 18:44:09,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {446#false} assume !(main_~node2__m2~1#1 > ~id2~0); {446#false} is VALID [2022-02-20 18:44:09,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {446#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; {446#false} is VALID [2022-02-20 18:44:09,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {446#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {446#false} is VALID [2022-02-20 18:44:09,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {446#false} assume main_~node3__m3~3#1 != ~nomsg~0; {446#false} is VALID [2022-02-20 18:44:09,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {446#false} assume !(0 == ~alive3~0 % 256); {446#false} is VALID [2022-02-20 18:44:09,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {446#false} assume !(main_~node3__m3~3#1 > ~id3~0); {446#false} is VALID [2022-02-20 18:44:09,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {446#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; {446#false} is VALID [2022-02-20 18:44:09,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {446#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7499~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7499~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; {446#false} is VALID [2022-02-20 18:44:09,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {446#false} assume 0 == main_~assert__arg~5#1 % 256; {446#false} is VALID [2022-02-20 18:44:09,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-02-20 18:44:09,587 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:09,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:09,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569000531] [2022-02-20 18:44:09,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569000531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:09,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:09,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:09,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775222557] [2022-02-20 18:44:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:09,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:09,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:09,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:09,648 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:09,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:09,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:09,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:09,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:09,665 INFO L87 Difference]: Start difference. First operand has 442 states, 437 states have (on average 1.8581235697940504) internal successors, (812), 441 states have internal predecessors, (812), 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.666666666666668) internal successors, (50), 3 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:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:10,506 INFO L93 Difference]: Finished difference Result 690 states and 1215 transitions. [2022-02-20 18:44:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:10,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1215 transitions. [2022-02-20 18:44:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1215 transitions. [2022-02-20 18:44:10,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1215 transitions. [2022-02-20 18:44:11,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1215 edges. 1215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:11,363 INFO L225 Difference]: With dead ends: 690 [2022-02-20 18:44:11,363 INFO L226 Difference]: Without dead ends: 546 [2022-02-20 18:44:11,366 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:11,368 INFO L933 BasicCegarLoop]: 833 mSDtfsCounter, 422 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1360 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:11,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 1360 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:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-02-20 18:44:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 540. [2022-02-20 18:44:11,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:11,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand has 540 states, 536 states have (on average 1.333955223880597) internal successors, (715), 539 states have internal predecessors, (715), 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:11,410 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand has 540 states, 536 states have (on average 1.333955223880597) internal successors, (715), 539 states have internal predecessors, (715), 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:11,411 INFO L87 Difference]: Start difference. First operand 546 states. Second operand has 540 states, 536 states have (on average 1.333955223880597) internal successors, (715), 539 states have internal predecessors, (715), 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:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:11,426 INFO L93 Difference]: Finished difference Result 546 states and 719 transitions. [2022-02-20 18:44:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 719 transitions. [2022-02-20 18:44:11,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:11,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:11,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 540 states, 536 states have (on average 1.333955223880597) internal successors, (715), 539 states have internal predecessors, (715), 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 546 states. [2022-02-20 18:44:11,434 INFO L87 Difference]: Start difference. First operand has 540 states, 536 states have (on average 1.333955223880597) internal successors, (715), 539 states have internal predecessors, (715), 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 546 states. [2022-02-20 18:44:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:11,450 INFO L93 Difference]: Finished difference Result 546 states and 719 transitions. [2022-02-20 18:44:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 719 transitions. [2022-02-20 18:44:11,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:11,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:11,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:11,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 536 states have (on average 1.333955223880597) internal successors, (715), 539 states have internal predecessors, (715), 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:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 715 transitions. [2022-02-20 18:44:11,470 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 715 transitions. Word has length 50 [2022-02-20 18:44:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:11,471 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 715 transitions. [2022-02-20 18:44:11,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 715 transitions. [2022-02-20 18:44:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:44:11,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:11,474 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:11,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:44:11,474 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:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -88586633, now seen corresponding path program 1 times [2022-02-20 18:44:11,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:11,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443011038] [2022-02-20 18:44:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:11,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {2997#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {2997#true} is VALID [2022-02-20 18:44:11,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {2997#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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {2997#true} is VALID [2022-02-20 18:44:11,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {2997#true} assume 0 == ~r1~0; {2997#true} is VALID [2022-02-20 18:44:11,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {2997#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {2997#true} is VALID [2022-02-20 18:44:11,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {2997#true} assume ~id1~0 >= 0; {2997#true} is VALID [2022-02-20 18:44:11,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {2997#true} assume 0 == ~st1~0; {2997#true} is VALID [2022-02-20 18:44:11,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {2997#true} assume ~send1~0 == ~id1~0; {2997#true} is VALID [2022-02-20 18:44:11,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {2997#true} assume 0 == ~mode1~0 % 256; {2997#true} is VALID [2022-02-20 18:44:11,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2997#true} assume ~id2~0 >= 0; {2997#true} is VALID [2022-02-20 18:44:11,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {2997#true} assume 0 == ~st2~0; {2997#true} is VALID [2022-02-20 18:44:11,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {2997#true} assume ~send2~0 == ~id2~0; {2997#true} is VALID [2022-02-20 18:44:11,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {2997#true} assume 0 == ~mode2~0 % 256; {2997#true} is VALID [2022-02-20 18:44:11,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {2997#true} assume ~id3~0 >= 0; {2997#true} is VALID [2022-02-20 18:44:11,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {2997#true} assume 0 == ~st3~0; {2997#true} is VALID [2022-02-20 18:44:11,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {2997#true} assume ~send3~0 == ~id3~0; {2997#true} is VALID [2022-02-20 18:44:11,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {2997#true} assume 0 == ~mode3~0 % 256; {2997#true} is VALID [2022-02-20 18:44:11,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {2997#true} assume ~id1~0 != ~id2~0; {2997#true} is VALID [2022-02-20 18:44:11,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {2997#true} assume ~id1~0 != ~id3~0; {2997#true} is VALID [2022-02-20 18:44:11,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {2997#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {2997#true} is VALID [2022-02-20 18:44:11,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {2997#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; {2997#true} is VALID [2022-02-20 18:44:11,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {2997#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2997#true} is VALID [2022-02-20 18:44:11,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {2997#true} assume !!(0 == ~mode1~0 % 256); {2997#true} is VALID [2022-02-20 18:44:11,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {2997#true} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {2999#(= (+ ~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; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {2999#(= (+ ~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; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 < 3;main_~check__tmp~56#1 := 1;~__return_8349~0 := main_~check__tmp~56#1;main_~main__c1~0#1 := ~__return_8349~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; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == main_~assert__arg~55#1 % 256);main_~main____CPAchecker_TMP_0~52#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~52#1; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:11,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {2999#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {2998#false} is VALID [2022-02-20 18:44:11,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {2998#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2998#false} is VALID [2022-02-20 18:44:11,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {2998#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; {2998#false} is VALID [2022-02-20 18:44:11,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {2998#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2998#false} is VALID [2022-02-20 18:44:11,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {2998#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {2998#false} is VALID [2022-02-20 18:44:11,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {2998#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {2998#false} is VALID [2022-02-20 18:44:11,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {2998#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2998#false} is VALID [2022-02-20 18:44:11,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {2998#false} assume main_~node3__m3~4#1 != ~nomsg~0; {2998#false} is VALID [2022-02-20 18:44:11,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {2998#false} assume !(0 == ~alive3~0 % 256); {2998#false} is VALID [2022-02-20 18:44:11,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {2998#false} assume !(main_~node3__m3~4#1 > ~id3~0); {2998#false} is VALID [2022-02-20 18:44:11,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {2998#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; {2998#false} is VALID [2022-02-20 18:44:11,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {2998#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_6769~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_6769~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; {2998#false} is VALID [2022-02-20 18:44:11,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {2998#false} assume 0 == main_~assert__arg~7#1 % 256; {2998#false} is VALID [2022-02-20 18:44:11,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {2998#false} assume !false; {2998#false} is VALID [2022-02-20 18:44:11,571 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:11,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:11,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443011038] [2022-02-20 18:44:11,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443011038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:11,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:11,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:11,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953711230] [2022-02-20 18:44:11,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:11,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:11,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:11,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:11,602 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:11,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:11,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:11,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:11,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:11,606 INFO L87 Difference]: Start difference. First operand 540 states and 715 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:12,160 INFO L93 Difference]: Finished difference Result 955 states and 1317 transitions. [2022-02-20 18:44:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:12,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2022-02-20 18:44:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2022-02-20 18:44:12,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 924 transitions. [2022-02-20 18:44:12,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 924 edges. 924 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:12,752 INFO L225 Difference]: With dead ends: 955 [2022-02-20 18:44:12,752 INFO L226 Difference]: Without dead ends: 714 [2022-02-20 18:44:12,753 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:12,754 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 236 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1018 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:12,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1018 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:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-02-20 18:44:12,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 708. [2022-02-20 18:44:12,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:12,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand has 708 states, 704 states have (on average 1.3536931818181819) internal successors, (953), 707 states have internal predecessors, (953), 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:12,780 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand has 708 states, 704 states have (on average 1.3536931818181819) internal successors, (953), 707 states have internal predecessors, (953), 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:12,781 INFO L87 Difference]: Start difference. First operand 714 states. Second operand has 708 states, 704 states have (on average 1.3536931818181819) internal successors, (953), 707 states have internal predecessors, (953), 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:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:12,802 INFO L93 Difference]: Finished difference Result 714 states and 957 transitions. [2022-02-20 18:44:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 957 transitions. [2022-02-20 18:44:12,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:12,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:12,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 708 states, 704 states have (on average 1.3536931818181819) internal successors, (953), 707 states have internal predecessors, (953), 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 714 states. [2022-02-20 18:44:12,805 INFO L87 Difference]: Start difference. First operand has 708 states, 704 states have (on average 1.3536931818181819) internal successors, (953), 707 states have internal predecessors, (953), 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 714 states. [2022-02-20 18:44:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:12,823 INFO L93 Difference]: Finished difference Result 714 states and 957 transitions. [2022-02-20 18:44:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 957 transitions. [2022-02-20 18:44:12,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:12,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:12,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:12,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 704 states have (on average 1.3536931818181819) internal successors, (953), 707 states have internal predecessors, (953), 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:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 953 transitions. [2022-02-20 18:44:12,844 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 953 transitions. Word has length 50 [2022-02-20 18:44:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:12,845 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 953 transitions. [2022-02-20 18:44:12,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 953 transitions. [2022-02-20 18:44:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:44:12,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:12,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] [2022-02-20 18:44:12,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:44:12,847 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:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash 301591798, now seen corresponding path program 1 times [2022-02-20 18:44:12,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:12,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866772367] [2022-02-20 18:44:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:12,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {6463#true} is VALID [2022-02-20 18:44:12,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {6463#true} is VALID [2022-02-20 18:44:12,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {6463#true} assume 0 == ~r1~0; {6463#true} is VALID [2022-02-20 18:44:12,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {6463#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {6463#true} is VALID [2022-02-20 18:44:12,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {6463#true} assume ~id1~0 >= 0; {6463#true} is VALID [2022-02-20 18:44:12,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {6463#true} assume 0 == ~st1~0; {6463#true} is VALID [2022-02-20 18:44:12,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {6463#true} assume ~send1~0 == ~id1~0; {6463#true} is VALID [2022-02-20 18:44:12,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {6463#true} assume 0 == ~mode1~0 % 256; {6463#true} is VALID [2022-02-20 18:44:12,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {6463#true} assume ~id2~0 >= 0; {6463#true} is VALID [2022-02-20 18:44:12,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {6463#true} assume 0 == ~st2~0; {6463#true} is VALID [2022-02-20 18:44:12,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {6463#true} assume ~send2~0 == ~id2~0; {6463#true} is VALID [2022-02-20 18:44:12,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {6463#true} assume 0 == ~mode2~0 % 256; {6463#true} is VALID [2022-02-20 18:44:12,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {6463#true} assume ~id3~0 >= 0; {6463#true} is VALID [2022-02-20 18:44:12,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#true} assume 0 == ~st3~0; {6463#true} is VALID [2022-02-20 18:44:12,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {6463#true} assume ~send3~0 == ~id3~0; {6463#true} is VALID [2022-02-20 18:44:12,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {6463#true} assume 0 == ~mode3~0 % 256; {6463#true} is VALID [2022-02-20 18:44:12,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {6463#true} assume ~id1~0 != ~id2~0; {6463#true} is VALID [2022-02-20 18:44:12,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {6463#true} assume ~id1~0 != ~id3~0; {6463#true} is VALID [2022-02-20 18:44:12,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {6463#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {6463#true} is VALID [2022-02-20 18:44:12,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#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; {6463#true} is VALID [2022-02-20 18:44:12,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {6463#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6463#true} is VALID [2022-02-20 18:44:12,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {6463#true} assume !!(0 == ~mode1~0 % 256); {6463#true} is VALID [2022-02-20 18:44:12,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {6463#true} assume !!(0 == ~alive1~0 % 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {6463#true} is VALID [2022-02-20 18:44:12,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {6463#true} assume !!(0 == ~mode2~0 % 256); {6463#true} is VALID [2022-02-20 18:44:12,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {6463#true} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {6463#true} is VALID [2022-02-20 18:44:12,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {6463#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; {6463#true} is VALID [2022-02-20 18:44:12,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {6463#true} assume !!(0 == ~mode3~0 % 256); {6463#true} is VALID [2022-02-20 18:44:12,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {6463#true} assume !!(0 == ~alive3~0 % 256); {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {6465#(= (+ (* (- 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; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 < 3;main_~check__tmp~48#1 := 1;~__return_8056~0 := main_~check__tmp~48#1;main_~main__c1~0#1 := ~__return_8056~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; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == main_~assert__arg~47#1 % 256);main_~main____CPAchecker_TMP_0~44#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~44#1; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {6465#(= (+ (* (- 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; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive2~0 % 256); {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {6465#(= (+ (* (- 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; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {6465#(= (+ (* (- 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; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~3#1 != ~nomsg~0; {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:12,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {6465#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {6464#false} is VALID [2022-02-20 18:44:12,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {6464#false} assume !(main_~node3__m3~3#1 > ~id3~0); {6464#false} is VALID [2022-02-20 18:44:12,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {6464#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; {6464#false} is VALID [2022-02-20 18:44:12,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {6464#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7499~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7499~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; {6464#false} is VALID [2022-02-20 18:44:12,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {6464#false} assume 0 == main_~assert__arg~5#1 % 256; {6464#false} is VALID [2022-02-20 18:44:12,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {6464#false} assume !false; {6464#false} is VALID [2022-02-20 18:44:12,915 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:12,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:12,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866772367] [2022-02-20 18:44:12,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866772367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:12,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:12,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:12,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257333416] [2022-02-20 18:44:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:12,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:12,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:12,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:12,944 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:12,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:12,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:12,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:12,947 INFO L87 Difference]: Start difference. First operand 708 states and 953 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:13,553 INFO L93 Difference]: Finished difference Result 1364 states and 1888 transitions. [2022-02-20 18:44:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:13,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 896 transitions. [2022-02-20 18:44:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 896 transitions. [2022-02-20 18:44:13,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 896 transitions. [2022-02-20 18:44:14,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 896 edges. 896 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:14,127 INFO L225 Difference]: With dead ends: 1364 [2022-02-20 18:44:14,128 INFO L226 Difference]: Without dead ends: 1035 [2022-02-20 18:44:14,129 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:14,130 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 297 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 994 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:14,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 994 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:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-02-20 18:44:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1028. [2022-02-20 18:44:14,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:14,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1035 states. Second operand has 1028 states, 1024 states have (on average 1.3642578125) internal successors, (1397), 1027 states have internal predecessors, (1397), 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:14,155 INFO L74 IsIncluded]: Start isIncluded. First operand 1035 states. Second operand has 1028 states, 1024 states have (on average 1.3642578125) internal successors, (1397), 1027 states have internal predecessors, (1397), 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:14,156 INFO L87 Difference]: Start difference. First operand 1035 states. Second operand has 1028 states, 1024 states have (on average 1.3642578125) internal successors, (1397), 1027 states have internal predecessors, (1397), 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:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:14,189 INFO L93 Difference]: Finished difference Result 1035 states and 1402 transitions. [2022-02-20 18:44:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1402 transitions. [2022-02-20 18:44:14,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:14,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:14,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 1028 states, 1024 states have (on average 1.3642578125) internal successors, (1397), 1027 states have internal predecessors, (1397), 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 1035 states. [2022-02-20 18:44:14,193 INFO L87 Difference]: Start difference. First operand has 1028 states, 1024 states have (on average 1.3642578125) internal successors, (1397), 1027 states have internal predecessors, (1397), 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 1035 states. [2022-02-20 18:44:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:14,226 INFO L93 Difference]: Finished difference Result 1035 states and 1402 transitions. [2022-02-20 18:44:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1402 transitions. [2022-02-20 18:44:14,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:14,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:14,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:14,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1024 states have (on average 1.3642578125) internal successors, (1397), 1027 states have internal predecessors, (1397), 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:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1397 transitions. [2022-02-20 18:44:14,266 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1397 transitions. Word has length 50 [2022-02-20 18:44:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:14,266 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1397 transitions. [2022-02-20 18:44:14,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1397 transitions. [2022-02-20 18:44:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:44:14,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:14,268 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:14,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:44:14,268 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:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash 157307916, now seen corresponding path program 1 times [2022-02-20 18:44:14,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:14,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194493025] [2022-02-20 18:44:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:14,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {11555#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {11557#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {11557#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {11557#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {11557#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {11557#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {11557#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {11557#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {11557#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:14,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {11557#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {11558#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:14,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {11558#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {11558#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:14,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {11558#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {11559#(<= (+ ~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; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {11559#(<= (+ ~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; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {11559#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {11559#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:14,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {11559#(<= (+ ~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; {11556#false} is VALID [2022-02-20 18:44:14,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {11556#false} assume !!(0 == ~mode3~0 % 256); {11556#false} is VALID [2022-02-20 18:44:14,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {11556#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~10#1; {11556#false} is VALID [2022-02-20 18:44:14,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {11556#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; {11556#false} is VALID [2022-02-20 18:44:14,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {11556#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11556#false} is VALID [2022-02-20 18:44:14,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {11556#false} assume ~r1~0 < 3;main_~check__tmp~46#1 := 1;~__return_7993~0 := main_~check__tmp~46#1;main_~main__c1~0#1 := ~__return_7993~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; {11556#false} is VALID [2022-02-20 18:44:14,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {11556#false} assume !(0 == main_~assert__arg~45#1 % 256);main_~main____CPAchecker_TMP_0~42#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~42#1; {11556#false} is VALID [2022-02-20 18:44:14,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {11556#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {11556#false} is VALID [2022-02-20 18:44:14,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {11556#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11556#false} is VALID [2022-02-20 18:44:14,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {11556#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11556#false} is VALID [2022-02-20 18:44:14,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {11556#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {11556#false} is VALID [2022-02-20 18:44:14,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {11556#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {11556#false} is VALID [2022-02-20 18:44:14,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {11556#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11556#false} is VALID [2022-02-20 18:44:14,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {11556#false} assume main_~node2__m2~1#1 != ~nomsg~0; {11556#false} is VALID [2022-02-20 18:44:14,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {11556#false} assume !(0 == ~alive2~0 % 256); {11556#false} is VALID [2022-02-20 18:44:14,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {11556#false} assume !(main_~node2__m2~1#1 > ~id2~0); {11556#false} is VALID [2022-02-20 18:44:14,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {11556#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; {11556#false} is VALID [2022-02-20 18:44:14,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {11556#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11556#false} is VALID [2022-02-20 18:44:14,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {11556#false} assume main_~node3__m3~3#1 != ~nomsg~0; {11556#false} is VALID [2022-02-20 18:44:14,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {11556#false} assume !(0 == ~alive3~0 % 256); {11556#false} is VALID [2022-02-20 18:44:14,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {11556#false} assume !(main_~node3__m3~3#1 > ~id3~0); {11556#false} is VALID [2022-02-20 18:44:14,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {11556#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; {11556#false} is VALID [2022-02-20 18:44:14,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {11556#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7499~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7499~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; {11556#false} is VALID [2022-02-20 18:44:14,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {11556#false} assume 0 == main_~assert__arg~5#1 % 256; {11556#false} is VALID [2022-02-20 18:44:14,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {11556#false} assume !false; {11556#false} is VALID [2022-02-20 18:44:14,351 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:14,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:14,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194493025] [2022-02-20 18:44:14,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194493025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:14,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:14,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:14,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504121367] [2022-02-20 18:44:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:14,352 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:14,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:14,353 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:14,380 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:14,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:14,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:14,380 INFO L87 Difference]: Start difference. First operand 1028 states and 1397 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:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:15,807 INFO L93 Difference]: Finished difference Result 2117 states and 2920 transitions. [2022-02-20 18:44:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:15,807 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:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:15,807 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:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-02-20 18:44:15,811 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:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-02-20 18:44:15,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 997 transitions. [2022-02-20 18:44:16,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 997 edges. 997 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:16,491 INFO L225 Difference]: With dead ends: 2117 [2022-02-20 18:44:16,491 INFO L226 Difference]: Without dead ends: 1255 [2022-02-20 18:44:16,492 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:16,493 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 1684 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:16,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1684 Valid, 399 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:44:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2022-02-20 18:44:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1245. [2022-02-20 18:44:16,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:16,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1255 states. Second operand has 1245 states, 1241 states have (on average 1.3738920225624496) internal successors, (1705), 1244 states have internal predecessors, (1705), 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:16,947 INFO L74 IsIncluded]: Start isIncluded. First operand 1255 states. Second operand has 1245 states, 1241 states have (on average 1.3738920225624496) internal successors, (1705), 1244 states have internal predecessors, (1705), 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:16,949 INFO L87 Difference]: Start difference. First operand 1255 states. Second operand has 1245 states, 1241 states have (on average 1.3738920225624496) internal successors, (1705), 1244 states have internal predecessors, (1705), 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:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:16,993 INFO L93 Difference]: Finished difference Result 1255 states and 1713 transitions. [2022-02-20 18:44:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1713 transitions. [2022-02-20 18:44:16,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:16,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:16,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 1245 states, 1241 states have (on average 1.3738920225624496) internal successors, (1705), 1244 states have internal predecessors, (1705), 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 1255 states. [2022-02-20 18:44:16,998 INFO L87 Difference]: Start difference. First operand has 1245 states, 1241 states have (on average 1.3738920225624496) internal successors, (1705), 1244 states have internal predecessors, (1705), 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 1255 states. [2022-02-20 18:44:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:17,042 INFO L93 Difference]: Finished difference Result 1255 states and 1713 transitions. [2022-02-20 18:44:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1713 transitions. [2022-02-20 18:44:17,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:17,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:17,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:17,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1241 states have (on average 1.3738920225624496) internal successors, (1705), 1244 states have internal predecessors, (1705), 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:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1705 transitions. [2022-02-20 18:44:17,098 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1705 transitions. Word has length 50 [2022-02-20 18:44:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:17,099 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 1705 transitions. [2022-02-20 18:44:17,099 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:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1705 transitions. [2022-02-20 18:44:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:17,101 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:17,101 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:17,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:44:17,102 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:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1701829494, now seen corresponding path program 1 times [2022-02-20 18:44:17,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:17,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584739402] [2022-02-20 18:44:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:17,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {18397#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {18399#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:17,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {18399#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {18399#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:17,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {18399#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {18399#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:17,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {18399#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {18399#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:17,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {18399#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {18400#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:17,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {18400#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {18400#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:17,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {18400#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {18401#(<= (+ ~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; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {18401#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18401#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:17,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {18401#(<= (+ ~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; {18398#false} is VALID [2022-02-20 18:44:17,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {18398#false} assume !!(0 == ~mode2~0 % 256); {18398#false} is VALID [2022-02-20 18:44:17,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {18398#false} assume !!(0 == ~alive2~0 % 256); {18398#false} is VALID [2022-02-20 18:44:17,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {18398#false} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {18398#false} assume !!(0 == ~mode3~0 % 256); {18398#false} is VALID [2022-02-20 18:44:17,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {18398#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~8#1; {18398#false} is VALID [2022-02-20 18:44:17,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {18398#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; {18398#false} is VALID [2022-02-20 18:44:17,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {18398#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18398#false} is VALID [2022-02-20 18:44:17,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {18398#false} assume ~r1~0 < 3;main_~check__tmp~38#1 := 1;~__return_6885~0 := main_~check__tmp~38#1;main_~main__c1~0#1 := ~__return_6885~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; {18398#false} is VALID [2022-02-20 18:44:17,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {18398#false} assume !(0 == main_~assert__arg~37#1 % 256);main_~main____CPAchecker_TMP_0~34#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~34#1; {18398#false} is VALID [2022-02-20 18:44:17,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {18398#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {18398#false} is VALID [2022-02-20 18:44:17,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {18398#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {18398#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {18398#false} assume main_~node1__m1~1#1 != ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {18398#false} assume !(0 == ~alive1~0 % 256); {18398#false} is VALID [2022-02-20 18:44:17,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {18398#false} assume !(main_~node1__m1~1#1 > ~id1~0); {18398#false} is VALID [2022-02-20 18:44:17,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {18398#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; {18398#false} is VALID [2022-02-20 18:44:17,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {18398#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {18398#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {18398#false} is VALID [2022-02-20 18:44:17,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {18398#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {18398#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {18398#false} assume main_~node3__m3~4#1 != ~nomsg~0; {18398#false} is VALID [2022-02-20 18:44:17,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {18398#false} assume !(0 == ~alive3~0 % 256); {18398#false} is VALID [2022-02-20 18:44:17,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {18398#false} assume !(main_~node3__m3~4#1 > ~id3~0); {18398#false} is VALID [2022-02-20 18:44:17,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {18398#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; {18398#false} is VALID [2022-02-20 18:44:17,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {18398#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_6769~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_6769~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; {18398#false} is VALID [2022-02-20 18:44:17,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {18398#false} assume 0 == main_~assert__arg~7#1 % 256; {18398#false} is VALID [2022-02-20 18:44:17,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {18398#false} assume !false; {18398#false} is VALID [2022-02-20 18:44:17,214 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:17,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:17,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584739402] [2022-02-20 18:44:17,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584739402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:17,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:17,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:17,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392284037] [2022-02-20 18:44:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:17,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:17,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:17,250 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:17,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:17,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:17,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:17,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:17,250 INFO L87 Difference]: Start difference. First operand 1245 states and 1705 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:19,146 INFO L93 Difference]: Finished difference Result 2643 states and 3662 transitions. [2022-02-20 18:44:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 839 transitions. [2022-02-20 18:44:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 839 transitions. [2022-02-20 18:44:19,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 839 transitions. [2022-02-20 18:44:19,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 839 edges. 839 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:19,783 INFO L225 Difference]: With dead ends: 2643 [2022-02-20 18:44:19,783 INFO L226 Difference]: Without dead ends: 1579 [2022-02-20 18:44:19,784 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:19,785 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 1436 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:19,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1436 Valid, 342 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-02-20 18:44:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1177. [2022-02-20 18:44:20,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:20,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1579 states. Second operand has 1177 states, 1173 states have (on average 1.3725490196078431) internal successors, (1610), 1176 states have internal predecessors, (1610), 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:20,541 INFO L74 IsIncluded]: Start isIncluded. First operand 1579 states. Second operand has 1177 states, 1173 states have (on average 1.3725490196078431) internal successors, (1610), 1176 states have internal predecessors, (1610), 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:20,542 INFO L87 Difference]: Start difference. First operand 1579 states. Second operand has 1177 states, 1173 states have (on average 1.3725490196078431) internal successors, (1610), 1176 states have internal predecessors, (1610), 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:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:20,658 INFO L93 Difference]: Finished difference Result 1579 states and 2159 transitions. [2022-02-20 18:44:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2159 transitions. [2022-02-20 18:44:20,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:20,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:20,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.3725490196078431) internal successors, (1610), 1176 states have internal predecessors, (1610), 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 1579 states. [2022-02-20 18:44:20,670 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.3725490196078431) internal successors, (1610), 1176 states have internal predecessors, (1610), 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 1579 states. [2022-02-20 18:44:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:20,746 INFO L93 Difference]: Finished difference Result 1579 states and 2159 transitions. [2022-02-20 18:44:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2159 transitions. [2022-02-20 18:44:20,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:20,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:20,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:20,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.3725490196078431) internal successors, (1610), 1176 states have internal predecessors, (1610), 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:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1610 transitions. [2022-02-20 18:44:20,810 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1610 transitions. Word has length 51 [2022-02-20 18:44:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:20,810 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1610 transitions. [2022-02-20 18:44:20,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1610 transitions. [2022-02-20 18:44:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:20,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:20,812 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:20,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:20,813 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:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1906241974, now seen corresponding path program 1 times [2022-02-20 18:44:20,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:20,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827897352] [2022-02-20 18:44:20,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:20,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {26575#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {26577#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {26577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:20,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {26577#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {26578#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:20,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {26578#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {26578#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:20,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {26578#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {26579#(<= (+ ~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; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {26579#(<= (+ ~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; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {26579#(<= (+ ~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; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {26579#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~9#1; {26579#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:20,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {26579#(<= (+ ~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; {26576#false} is VALID [2022-02-20 18:44:20,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {26576#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {26576#false} is VALID [2022-02-20 18:44:20,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {26576#false} assume ~r1~0 < 3;main_~check__tmp~42#1 := 1;~__return_8140~0 := main_~check__tmp~42#1;main_~main__c1~0#1 := ~__return_8140~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; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {26576#false} assume !(0 == main_~assert__arg~41#1 % 256);main_~main____CPAchecker_TMP_0~38#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~38#1; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {26576#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {26576#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {26576#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {26576#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {26576#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {26576#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26576#false} is VALID [2022-02-20 18:44:20,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {26576#false} assume main_~node2__m2~1#1 != ~nomsg~0; {26576#false} is VALID [2022-02-20 18:44:20,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {26576#false} assume !(0 == ~alive2~0 % 256); {26576#false} is VALID [2022-02-20 18:44:20,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {26576#false} assume !(main_~node2__m2~1#1 > ~id2~0); {26576#false} is VALID [2022-02-20 18:44:20,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {26576#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; {26576#false} is VALID [2022-02-20 18:44:20,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {26576#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26576#false} is VALID [2022-02-20 18:44:20,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {26576#false} assume main_~node3__m3~3#1 != ~nomsg~0; {26576#false} is VALID [2022-02-20 18:44:20,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {26576#false} assume !(0 == ~alive3~0 % 256); {26576#false} is VALID [2022-02-20 18:44:20,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {26576#false} assume !(main_~node3__m3~3#1 > ~id3~0); {26576#false} is VALID [2022-02-20 18:44:20,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {26576#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; {26576#false} is VALID [2022-02-20 18:44:20,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {26576#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7499~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7499~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; {26576#false} is VALID [2022-02-20 18:44:20,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {26576#false} assume 0 == main_~assert__arg~5#1 % 256; {26576#false} is VALID [2022-02-20 18:44:20,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {26576#false} assume !false; {26576#false} is VALID [2022-02-20 18:44:20,902 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:20,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:20,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827897352] [2022-02-20 18:44:20,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827897352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:20,903 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:20,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:20,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075736523] [2022-02-20 18:44:20,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:20,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:20,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:20,931 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:20,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:20,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:20,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:20,932 INFO L87 Difference]: Start difference. First operand 1177 states and 1610 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:23,148 INFO L93 Difference]: Finished difference Result 2592 states and 3567 transitions. [2022-02-20 18:44:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2022-02-20 18:44:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2022-02-20 18:44:23,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 756 transitions. [2022-02-20 18:44:23,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 756 edges. 756 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:23,699 INFO L225 Difference]: With dead ends: 2592 [2022-02-20 18:44:23,699 INFO L226 Difference]: Without dead ends: 1534 [2022-02-20 18:44:23,700 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:23,700 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 1270 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:23,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1270 Valid, 316 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-02-20 18:44:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1521. [2022-02-20 18:44:25,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:25,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1534 states. Second operand has 1521 states, 1517 states have (on average 1.3645352669742914) internal successors, (2070), 1520 states have internal predecessors, (2070), 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:25,053 INFO L74 IsIncluded]: Start isIncluded. First operand 1534 states. Second operand has 1521 states, 1517 states have (on average 1.3645352669742914) internal successors, (2070), 1520 states have internal predecessors, (2070), 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:25,054 INFO L87 Difference]: Start difference. First operand 1534 states. Second operand has 1521 states, 1517 states have (on average 1.3645352669742914) internal successors, (2070), 1520 states have internal predecessors, (2070), 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:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:25,114 INFO L93 Difference]: Finished difference Result 1534 states and 2081 transitions. [2022-02-20 18:44:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2081 transitions. [2022-02-20 18:44:25,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:25,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 1521 states, 1517 states have (on average 1.3645352669742914) internal successors, (2070), 1520 states have internal predecessors, (2070), 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 1534 states. [2022-02-20 18:44:25,119 INFO L87 Difference]: Start difference. First operand has 1521 states, 1517 states have (on average 1.3645352669742914) internal successors, (2070), 1520 states have internal predecessors, (2070), 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 1534 states. [2022-02-20 18:44:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:25,178 INFO L93 Difference]: Finished difference Result 1534 states and 2081 transitions. [2022-02-20 18:44:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2081 transitions. [2022-02-20 18:44:25,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:25,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:25,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:25,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1517 states have (on average 1.3645352669742914) internal successors, (2070), 1520 states have internal predecessors, (2070), 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:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2070 transitions. [2022-02-20 18:44:25,257 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2070 transitions. Word has length 51 [2022-02-20 18:44:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:25,257 INFO L470 AbstractCegarLoop]: Abstraction has 1521 states and 2070 transitions. [2022-02-20 18:44:25,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2070 transitions. [2022-02-20 18:44:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:25,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:25,258 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:44:25,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:25,259 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:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1198562519, now seen corresponding path program 1 times [2022-02-20 18:44:25,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:25,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420573407] [2022-02-20 18:44:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:25,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {35105#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {35107#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {35107#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {35107#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {35107#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {35107#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {35107#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {35107#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {35107#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {35107#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode2~0 % 256; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id3~0 >= 0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st3~0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send3~0 == ~id3~0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode3~0 % 256; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id2~0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id3~0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {35108#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {35108#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {35108#(<= (+ ~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; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode1~0 % 256); {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {35109#(<= (+ ~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; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode2~0 % 256); {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send2~0 != ~nomsg~0; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {35109#(<= (+ ~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; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode3~0 % 256); {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~9#1; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {35109#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send3~0 != ~nomsg~0; {35109#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {35109#(<= (+ ~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; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~r1~0 < 3;main_~check__tmp~41#1 := 1;~__return_8172~0 := main_~check__tmp~41#1;main_~main__c1~0#1 := ~__return_8172~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; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == main_~assert__arg~40#1 % 256);main_~main____CPAchecker_TMP_0~37#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~37#1; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35110#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:44:25,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {35110#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35111#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:25,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {35111#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 != ~nomsg~0; {35111#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:25,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {35111#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(0 == ~alive2~0 % 256); {35111#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:25,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {35111#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(main_~node2__m2~1#1 > ~id2~0); {35111#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:44:25,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {35111#(<= (+ |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; {35106#false} is VALID [2022-02-20 18:44:25,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {35106#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35106#false} is VALID [2022-02-20 18:44:25,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {35106#false} assume main_~node3__m3~3#1 != ~nomsg~0; {35106#false} is VALID [2022-02-20 18:44:25,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {35106#false} assume !(0 == ~alive3~0 % 256); {35106#false} is VALID [2022-02-20 18:44:25,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {35106#false} assume !(main_~node3__m3~3#1 > ~id3~0); {35106#false} is VALID [2022-02-20 18:44:25,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {35106#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; {35106#false} is VALID [2022-02-20 18:44:25,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {35106#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7499~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7499~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; {35106#false} is VALID [2022-02-20 18:44:25,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {35106#false} assume 0 == main_~assert__arg~5#1 % 256; {35106#false} is VALID [2022-02-20 18:44:25,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {35106#false} assume !false; {35106#false} is VALID [2022-02-20 18:44:25,341 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:25,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:25,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420573407] [2022-02-20 18:44:25,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420573407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:25,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:25,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:44:25,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827120319] [2022-02-20 18:44:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:25,342 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:44:25,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:25,343 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:44:25,379 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:44:25,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:44:25,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:44:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:25,380 INFO L87 Difference]: Start difference. First operand 1521 states and 2070 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:44:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:33,979 INFO L93 Difference]: Finished difference Result 5054 states and 7046 transitions. [2022-02-20 18:44:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:44:33,980 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:44:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:33,980 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:44:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1025 transitions. [2022-02-20 18:44:33,983 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:44:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1025 transitions. [2022-02-20 18:44:33,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1025 transitions. [2022-02-20 18:44:34,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1025 edges. 1025 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:35,483 INFO L225 Difference]: With dead ends: 5054 [2022-02-20 18:44:35,483 INFO L226 Difference]: Without dead ends: 4621 [2022-02-20 18:44:35,488 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:44:35,489 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 2998 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2998 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:35,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2998 Valid, 630 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:44:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2022-02-20 18:44:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 1533. [2022-02-20 18:44:37,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:37,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4621 states. Second operand has 1533 states, 1529 states have (on average 1.3642903858731197) internal successors, (2086), 1532 states have internal predecessors, (2086), 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,397 INFO L74 IsIncluded]: Start isIncluded. First operand 4621 states. Second operand has 1533 states, 1529 states have (on average 1.3642903858731197) internal successors, (2086), 1532 states have internal predecessors, (2086), 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,398 INFO L87 Difference]: Start difference. First operand 4621 states. Second operand has 1533 states, 1529 states have (on average 1.3642903858731197) internal successors, (2086), 1532 states have internal predecessors, (2086), 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,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:37,932 INFO L93 Difference]: Finished difference Result 4621 states and 6445 transitions. [2022-02-20 18:44:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 6445 transitions. [2022-02-20 18:44:37,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:37,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:37,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 1533 states, 1529 states have (on average 1.3642903858731197) internal successors, (2086), 1532 states have internal predecessors, (2086), 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 4621 states. [2022-02-20 18:44:37,939 INFO L87 Difference]: Start difference. First operand has 1533 states, 1529 states have (on average 1.3642903858731197) internal successors, (2086), 1532 states have internal predecessors, (2086), 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 4621 states. [2022-02-20 18:44:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:38,509 INFO L93 Difference]: Finished difference Result 4621 states and 6445 transitions. [2022-02-20 18:44:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 6445 transitions. [2022-02-20 18:44:38,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:38,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:38,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:38,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1529 states have (on average 1.3642903858731197) internal successors, (2086), 1532 states have internal predecessors, (2086), 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,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2086 transitions. [2022-02-20 18:44:38,592 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2086 transitions. Word has length 52 [2022-02-20 18:44:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:38,593 INFO L470 AbstractCegarLoop]: Abstraction has 1533 states and 2086 transitions. [2022-02-20 18:44:38,593 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 18:44:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2086 transitions. [2022-02-20 18:44:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:38,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:38,594 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, 1] [2022-02-20 18:44:38,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:38,595 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1743373944, now seen corresponding path program 1 times [2022-02-20 18:44:38,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:38,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749080026] [2022-02-20 18:44:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:38,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {53485#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {53487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:38,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {53487#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {53487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:38,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {53487#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {53487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:38,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {53487#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {53487#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:38,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {53487#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode1~0 % 256; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 >= 0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st2~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send2~0 == ~id2~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode2~0 % 256; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id3~0 >= 0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st3~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send3~0 == ~id3~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode3~0 % 256; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id2~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id3~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {53488#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {53488#(<= (+ ~nomsg~0 1) ~id1~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; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode1~0 % 256); {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send1~0 != ~nomsg~0; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~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; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode2~0 % 256); {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send2~0 != ~nomsg~0; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode3~0 % 256); {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~alive3~0 % 256); {53489#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {53489#(<= (+ ~p3_new~0 1) ~id1~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~12#1; {53490#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {53490#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {53490#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {53490#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~r1~0 < 3;main_~check__tmp~12#1 := 1;~__return_7600~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_7600~0;havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~11#1;main_~assert__arg~11#1 := main_~__tmp_12~0#1; {53490#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {53490#(<= (+ ~p3_old~0 1) ~id1~0)} assume !(0 == main_~assert__arg~11#1 % 256);main_~main____CPAchecker_TMP_0~8#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~8#1; {53490#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {53490#(<= (+ ~p3_old~0 1) ~id1~0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {53490#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {53490#(<= (+ ~p3_old~0 1) ~id1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {53490#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:38,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {53490#(<= (+ ~p3_old~0 1) ~id1~0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:38,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:38,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(0 == ~alive1~0 % 256); {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:38,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:38,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {53491#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~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; {53486#false} is VALID [2022-02-20 18:44:38,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {53486#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {53486#false} is VALID [2022-02-20 18:44:38,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {53486#false} assume main_~node2__m2~3#1 != ~nomsg~0; {53486#false} is VALID [2022-02-20 18:44:38,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {53486#false} assume !(0 == ~alive2~0 % 256); {53486#false} is VALID [2022-02-20 18:44:38,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {53486#false} assume !(main_~node2__m2~3#1 > ~id2~0); {53486#false} is VALID [2022-02-20 18:44:38,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {53486#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {53486#false} is VALID [2022-02-20 18:44:38,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {53486#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {53486#false} is VALID [2022-02-20 18:44:38,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {53486#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {53486#false} is VALID [2022-02-20 18:44:38,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {53486#false} ~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~8#1; {53486#false} is VALID [2022-02-20 18:44:38,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {53486#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_7342~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_7342~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {53486#false} is VALID [2022-02-20 18:44:38,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {53486#false} assume 0 == main_~assert__arg~8#1 % 256; {53486#false} is VALID [2022-02-20 18:44:38,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {53486#false} assume !false; {53486#false} is VALID [2022-02-20 18:44:38,683 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:38,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:38,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749080026] [2022-02-20 18:44:38,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749080026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:38,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:38,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:44:38,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695190838] [2022-02-20 18:44:38,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2022-02-20 18:44:38,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:38,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:38,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:44:38,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:44:38,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:38,716 INFO L87 Difference]: Start difference. First operand 1533 states and 2086 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:48,243 INFO L93 Difference]: Finished difference Result 4964 states and 6883 transitions. [2022-02-20 18:44:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:44:48,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2022-02-20 18:44:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 865 transitions. [2022-02-20 18:44:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 865 transitions. [2022-02-20 18:44:48,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 865 transitions. [2022-02-20 18:44:48,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 865 edges. 865 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:49,519 INFO L225 Difference]: With dead ends: 4964 [2022-02-20 18:44:49,519 INFO L226 Difference]: Without dead ends: 4243 [2022-02-20 18:44:49,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:44:49,521 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 2507 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2507 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:49,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2507 Valid, 585 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:44:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2022-02-20 18:44:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 1547. [2022-02-20 18:44:52,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:52,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4243 states. Second operand has 1547 states, 1543 states have (on average 1.3635774465327284) internal successors, (2104), 1546 states have internal predecessors, (2104), 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:52,150 INFO L74 IsIncluded]: Start isIncluded. First operand 4243 states. Second operand has 1547 states, 1543 states have (on average 1.3635774465327284) internal successors, (2104), 1546 states have internal predecessors, (2104), 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:52,151 INFO L87 Difference]: Start difference. First operand 4243 states. Second operand has 1547 states, 1543 states have (on average 1.3635774465327284) internal successors, (2104), 1546 states have internal predecessors, (2104), 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:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:52,634 INFO L93 Difference]: Finished difference Result 4243 states and 5880 transitions. [2022-02-20 18:44:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 5880 transitions. [2022-02-20 18:44:52,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:52,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:52,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 1547 states, 1543 states have (on average 1.3635774465327284) internal successors, (2104), 1546 states have internal predecessors, (2104), 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 4243 states. [2022-02-20 18:44:52,640 INFO L87 Difference]: Start difference. First operand has 1547 states, 1543 states have (on average 1.3635774465327284) internal successors, (2104), 1546 states have internal predecessors, (2104), 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 4243 states. [2022-02-20 18:44:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:53,150 INFO L93 Difference]: Finished difference Result 4243 states and 5880 transitions. [2022-02-20 18:44:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 5880 transitions. [2022-02-20 18:44:53,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:53,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:53,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:53,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1543 states have (on average 1.3635774465327284) internal successors, (2104), 1546 states have internal predecessors, (2104), 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,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2104 transitions. [2022-02-20 18:44:53,245 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2104 transitions. Word has length 53 [2022-02-20 18:44:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:53,245 INFO L470 AbstractCegarLoop]: Abstraction has 1547 states and 2104 transitions. [2022-02-20 18:44:53,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2104 transitions. [2022-02-20 18:44:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:53,246 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:53,246 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, 1] [2022-02-20 18:44:53,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:44:53,247 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1359815673, now seen corresponding path program 1 times [2022-02-20 18:44:53,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:53,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480120974] [2022-02-20 18:44:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:53,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {70915#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_6067~0 := 0;~__return_7533~0 := 0;~__tmp_6155_0~0 := 0;~__return_6208~0 := 0;~__tmp_6218_0~0 := 0;~__tmp_6397_0~0 := 0;~__return_6278~0 := 0;~__tmp_6279_0~0 := 0;~__return_6292~0 := 0;~__return_6692~0 := 0;~__return_7253~0 := 0;~__return_7499~0 := 0;~__return_6511~0 := 0;~__return_6769~0 := 0;~__return_7342~0 := 0;~__return_7573~0 := 0;~__return_7459~0 := 0;~__return_7634~0 := 0;~__return_7600~0 := 0;~__return_7290~0 := 0;~__return_7199~0 := 0;~__return_7409~0 := 0;~__return_7375~0 := 0;~__return_7864~0 := 0;~__return_7832~0 := 0;~__return_7929~0 := 0;~__return_7895~0 := 0;~__return_7715~0 := 0;~__return_7683~0 := 0;~__return_7780~0 := 0;~__return_7746~0 := 0;~__return_6729~0 := 0;~__return_6650~0 := 0;~__return_6836~0 := 0;~__return_6802~0 := 0;~__return_6445~0 := 0;~__return_6145~0 := 0;~__return_6600~0 := 0;~__return_6566~0 := 0;~__return_7066~0 := 0;~__return_7034~0 := 0;~__return_7131~0 := 0;~__return_7097~0 := 0;~__return_6917~0 := 0;~__return_6885~0 := 0;~__return_6982~0 := 0;~__return_6948~0 := 0;~__return_8172~0 := 0;~__return_8140~0 := 0;~__return_8237~0 := 0;~__return_8203~0 := 0;~__return_8025~0 := 0;~__return_7993~0 := 0;~__return_8090~0 := 0;~__return_8056~0 := 0;~__return_8467~0 := 0;~__return_8435~0 := 0;~__return_8532~0 := 0;~__return_8498~0 := 0;~__return_8318~0 := 0;~__return_8286~0 := 0;~__return_8383~0 := 0;~__return_8349~0 := 0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {70917#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~main____CPAchecker_TMP_0~4#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_~main____CPAchecker_TMP_0~5#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~main____CPAchecker_TMP_0~12#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_~main____CPAchecker_TMP_0~13#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~main____CPAchecker_TMP_0~16#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_~main____CPAchecker_TMP_0~17#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~main____CPAchecker_TMP_0~20#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_~main____CPAchecker_TMP_0~21#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~main____CPAchecker_TMP_0~28#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_~main____CPAchecker_TMP_0~29#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~main____CPAchecker_TMP_0~32#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_~main____CPAchecker_TMP_0~33#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~34#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_0~35#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~main____CPAchecker_TMP_0~36#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_~main____CPAchecker_TMP_0~37#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~38#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_0~39#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~main____CPAchecker_TMP_0~40#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~main____CPAchecker_TMP_0~41#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~42#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_0~43#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~main____CPAchecker_TMP_0~44#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_~main____CPAchecker_TMP_0~45#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~46#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_0~47#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~main____CPAchecker_TMP_0~48#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_~main____CPAchecker_TMP_0~49#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~50#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_0~51#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~main____CPAchecker_TMP_0~52#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {70917#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:53,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {70917#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {70918#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {70918#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {70918#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {70918#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {70918#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {70918#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~mode3~0 % 256; {70918#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {70918#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id2~0; {70918#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {70918#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id3~0; {70918#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {70918#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {70918#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {70918#(<= (+ ~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; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode1~0 % 256); {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send1~0 != ~nomsg~0; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {70919#(<= (+ ~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; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode2~0 % 256); {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~alive2~0 % 256); {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {70919#(<= (+ ~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; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode3~0 % 256); {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {70919#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send3~0 != ~nomsg~0; {70919#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {70919#(<= (+ ~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; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~r1~0 < 3;main_~check__tmp~21#1 := 1;~__return_7715~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_7715~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; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == main_~assert__arg~20#1 % 256);main_~main____CPAchecker_TMP_0~17#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6155_0~0 := main_~main____CPAchecker_TMP_0~17#1; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6155_0~0; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256); {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {70920#(<= (+ ~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; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {70920#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:53,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {70920#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {70921#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:53,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {70921#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {70921#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:53,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {70921#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(0 == ~alive3~0 % 256); {70921#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:53,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {70921#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(main_~node3__m3~4#1 > ~id3~0); {70921#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:53,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {70921#(<= (+ |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; {70916#false} is VALID [2022-02-20 18:44:53,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {70916#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_6769~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_6769~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; {70916#false} is VALID [2022-02-20 18:44:53,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {70916#false} assume 0 == main_~assert__arg~7#1 % 256; {70916#false} is VALID [2022-02-20 18:44:53,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {70916#false} assume !false; {70916#false} is VALID [2022-02-20 18:44:53,322 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,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:53,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480120974] [2022-02-20 18:44:53,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480120974] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:53,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:53,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:44:53,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285684112] [2022-02-20 18:44:53,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2022-02-20 18:44:53,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:53,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:53,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:44:53,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:44:53,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:53,355 INFO L87 Difference]: Start difference. First operand 1547 states and 2104 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:06,526 INFO L93 Difference]: Finished difference Result 5348 states and 7493 transitions. [2022-02-20 18:45:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:45:06,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2022-02-20 18:45:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 891 transitions. [2022-02-20 18:45:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 891 transitions. [2022-02-20 18:45:06,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 891 transitions. [2022-02-20 18:45:07,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 891 edges. 891 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.