./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.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.1.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 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:43:31,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:43:31,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:43:32,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:43:32,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:43:32,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:43:32,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:43:32,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:43:32,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:43:32,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:43:32,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:43:32,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:43:32,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:43:32,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:43:32,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:43:32,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:43:32,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:43:32,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:43:32,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:43:32,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:43:32,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:43:32,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:43:32,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:43:32,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:43:32,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:43:32,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:43:32,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:43:32,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:43:32,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:43:32,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:43:32,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:43:32,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:43:32,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:43:32,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:43:32,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:43:32,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:43:32,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:43:32,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:43:32,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:43:32,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:43:32,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:43:32,049 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:43:32,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:43:32,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:43:32,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:43:32,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:43:32,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:43:32,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:43:32,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:43:32,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:43:32,080 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:43:32,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:43:32,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:43:32,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:43:32,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:43:32,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:43:32,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:43:32,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:43:32,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:43:32,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:43:32,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:43:32,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:43:32,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:43:32,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:43:32,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:43:32,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:43:32,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:32,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:43:32,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:43:32,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:43:32,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:43:32,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:43:32,084 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:43:32,084 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:43:32,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:43:32,085 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 -> 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e [2022-02-20 18:43:32,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:43:32,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:43:32,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:43:32,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:43:32,313 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:43:32,314 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:43:32,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1cc0426/36cd5ed0392b44dda234adad94cf2166/FLAGdabfe0b5e [2022-02-20 18:43:32,772 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:43:32,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:43:32,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1cc0426/36cd5ed0392b44dda234adad94cf2166/FLAGdabfe0b5e [2022-02-20 18:43:33,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1cc0426/36cd5ed0392b44dda234adad94cf2166 [2022-02-20 18:43:33,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:43:33,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:43:33,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:33,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:43:33,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:43:33,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1092d3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33, skipping insertion in model container [2022-02-20 18:43:33,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:43:33,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:43:33,473 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2022-02-20 18:43:33,518 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2022-02-20 18:43:33,529 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2022-02-20 18:43:33,533 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2022-02-20 18:43:33,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:33,641 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:43:33,664 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2022-02-20 18:43:33,677 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2022-02-20 18:43:33,682 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2022-02-20 18:43:33,684 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2022-02-20 18:43:33,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:33,797 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:43:33,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33 WrapperNode [2022-02-20 18:43:33,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:33,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:33,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:43:33,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:43:33,803 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:43:33" (1/1) ... [2022-02-20 18:43:33,829 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:43:33" (1/1) ... [2022-02-20 18:43:33,898 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2592 [2022-02-20 18:43:33,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:33,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:43:33,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:43:33,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:43:33,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:43:33,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:43:33,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:43:33,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:43:33,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (1/1) ... [2022-02-20 18:43:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:43:33,996 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:43:34,001 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:43:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:43:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:43:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:43:34,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:43:34,222 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:43:34,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:43:35,205 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:43:35,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:43:35,213 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:43:35,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:35 BoogieIcfgContainer [2022-02-20 18:43:35,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:43:35,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:43:35,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:43:35,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:43:35,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:43:33" (1/3) ... [2022-02-20 18:43:35,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0fd42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:35, skipping insertion in model container [2022-02-20 18:43:35,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:33" (2/3) ... [2022-02-20 18:43:35,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0fd42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:35, skipping insertion in model container [2022-02-20 18:43:35,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:35" (3/3) ... [2022-02-20 18:43:35,219 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:43:35,222 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:43:35,223 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 18:43:35,250 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:43:35,254 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:43:35,254 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 18:43:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 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:43:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:43:35,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:35,282 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:43:35,282 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:43:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:35,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1707798208, now seen corresponding path program 1 times [2022-02-20 18:43:35,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:35,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143299809] [2022-02-20 18:43:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:35,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {460#true} is VALID [2022-02-20 18:43:35,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {460#true} is VALID [2022-02-20 18:43:35,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume 0 == ~r1~0; {460#true} is VALID [2022-02-20 18:43:35,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {460#true} is VALID [2022-02-20 18:43:35,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume ~id1~0 >= 0; {460#true} is VALID [2022-02-20 18:43:35,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume 0 == ~st1~0; {460#true} is VALID [2022-02-20 18:43:35,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#true} assume ~send1~0 == ~id1~0; {460#true} is VALID [2022-02-20 18:43:35,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} assume 0 == ~mode1~0 % 256; {460#true} is VALID [2022-02-20 18:43:35,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume ~id2~0 >= 0; {460#true} is VALID [2022-02-20 18:43:35,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} assume 0 == ~st2~0; {460#true} is VALID [2022-02-20 18:43:35,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#true} assume ~send2~0 == ~id2~0; {460#true} is VALID [2022-02-20 18:43:35,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} assume 0 == ~mode2~0 % 256; {460#true} is VALID [2022-02-20 18:43:35,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#true} assume ~id3~0 >= 0; {460#true} is VALID [2022-02-20 18:43:35,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} assume 0 == ~st3~0; {460#true} is VALID [2022-02-20 18:43:35,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#true} assume ~send3~0 == ~id3~0; {460#true} is VALID [2022-02-20 18:43:35,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {460#true} assume 0 == ~mode3~0 % 256; {460#true} is VALID [2022-02-20 18:43:35,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#true} assume ~id1~0 != ~id2~0; {460#true} is VALID [2022-02-20 18:43:35,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {460#true} assume ~id1~0 != ~id3~0; {460#true} is VALID [2022-02-20 18:43:35,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {460#true} is VALID [2022-02-20 18:43:35,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {460#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; {460#true} is VALID [2022-02-20 18:43:35,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {460#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {460#true} is VALID [2022-02-20 18:43:35,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {460#true} assume !!(0 == ~mode1~0 % 256); {460#true} is VALID [2022-02-20 18:43:35,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {460#true} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {460#true} is VALID [2022-02-20 18:43:35,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {460#true} 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; {460#true} is VALID [2022-02-20 18:43:35,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {460#true} assume !!(0 == ~mode2~0 % 256); {460#true} is VALID [2022-02-20 18:43:35,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {460#true} assume !!(0 == ~alive2~0 % 256); {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {462#(= (+ (* (- 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~40#1; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~40#1 := 1;~__return_7217~0 := main_~check__tmp~40#1;main_~main__c1~0#1 := ~__return_7217~0;havoc main_~__tmp_40~0#1;main_~__tmp_40~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~39#1;main_~assert__arg~39#1 := main_~__tmp_40~0#1; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == main_~assert__arg~39#1 % 256);main_~main____CPAchecker_TMP_0~36#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6431_0~0 := main_~main____CPAchecker_TMP_0~36#1; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {462#(= (+ (* (- 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; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {462#(= (+ (* (- 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; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {462#(= (+ (* (- 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; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:35,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {461#false} is VALID [2022-02-20 18:43:35,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {461#false} assume !(main_~node2__m2~1#1 > ~id2~0); {461#false} is VALID [2022-02-20 18:43:35,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {461#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; {461#false} is VALID [2022-02-20 18:43:35,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {461#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {461#false} is VALID [2022-02-20 18:43:35,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {461#false} assume main_~node3__m3~3#1 != ~nomsg~0; {461#false} is VALID [2022-02-20 18:43:35,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {461#false} assume !(0 == ~alive3~0 % 256); {461#false} is VALID [2022-02-20 18:43:35,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {461#false} assume !(main_~node3__m3~3#1 > ~id3~0); {461#false} is VALID [2022-02-20 18:43:35,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {461#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; {461#false} is VALID [2022-02-20 18:43:35,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {461#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7768~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7768~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; {461#false} is VALID [2022-02-20 18:43:35,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {461#false} assume 0 == main_~assert__arg~5#1 % 256; {461#false} is VALID [2022-02-20 18:43:35,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 18:43:35,510 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:43:35,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:35,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143299809] [2022-02-20 18:43:35,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143299809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:35,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:35,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:35,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787519238] [2022-02-20 18:43:35,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:35,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:35,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:35,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:35,555 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:43:35,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:35,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:35,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:35,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:35,572 INFO L87 Difference]: Start difference. First operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 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 17.0) internal successors, (51), 3 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:43:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:36,435 INFO L93 Difference]: Finished difference Result 725 states and 1271 transitions. [2022-02-20 18:43:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:36,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2022-02-20 18:43:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2022-02-20 18:43:36,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1271 transitions. [2022-02-20 18:43:37,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1271 edges. 1271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:37,357 INFO L225 Difference]: With dead ends: 725 [2022-02-20 18:43:37,358 INFO L226 Difference]: Without dead ends: 571 [2022-02-20 18:43:37,360 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:43:37,364 INFO L933 BasicCegarLoop]: 865 mSDtfsCounter, 438 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1416 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:43:37,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 1416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-02-20 18:43:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 565. [2022-02-20 18:43:37,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:37,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 565 states, 561 states have (on average 1.3440285204991087) internal successors, (754), 564 states have internal predecessors, (754), 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:43:37,431 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 565 states, 561 states have (on average 1.3440285204991087) internal successors, (754), 564 states have internal predecessors, (754), 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:43:37,432 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 565 states, 561 states have (on average 1.3440285204991087) internal successors, (754), 564 states have internal predecessors, (754), 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:43:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:37,460 INFO L93 Difference]: Finished difference Result 571 states and 758 transitions. [2022-02-20 18:43:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2022-02-20 18:43:37,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:37,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:37,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 565 states, 561 states have (on average 1.3440285204991087) internal successors, (754), 564 states have internal predecessors, (754), 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 571 states. [2022-02-20 18:43:37,464 INFO L87 Difference]: Start difference. First operand has 565 states, 561 states have (on average 1.3440285204991087) internal successors, (754), 564 states have internal predecessors, (754), 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 571 states. [2022-02-20 18:43:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:37,480 INFO L93 Difference]: Finished difference Result 571 states and 758 transitions. [2022-02-20 18:43:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2022-02-20 18:43:37,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:37,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:37,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:37,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 561 states have (on average 1.3440285204991087) internal successors, (754), 564 states have internal predecessors, (754), 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:43:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 754 transitions. [2022-02-20 18:43:37,499 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 754 transitions. Word has length 51 [2022-02-20 18:43:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:37,500 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 754 transitions. [2022-02-20 18:43:37,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 754 transitions. [2022-02-20 18:43:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:43:37,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:37,501 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:43:37,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:43:37,502 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:43:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1349444518, now seen corresponding path program 1 times [2022-02-20 18:43:37,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:37,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814212290] [2022-02-20 18:43:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:37,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {3146#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {3146#true} is VALID [2022-02-20 18:43:37,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {3146#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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {3146#true} is VALID [2022-02-20 18:43:37,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {3146#true} assume 0 == ~r1~0; {3146#true} is VALID [2022-02-20 18:43:37,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {3146#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {3146#true} is VALID [2022-02-20 18:43:37,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {3146#true} assume ~id1~0 >= 0; {3146#true} is VALID [2022-02-20 18:43:37,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {3146#true} assume 0 == ~st1~0; {3146#true} is VALID [2022-02-20 18:43:37,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {3146#true} assume ~send1~0 == ~id1~0; {3146#true} is VALID [2022-02-20 18:43:37,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {3146#true} assume 0 == ~mode1~0 % 256; {3146#true} is VALID [2022-02-20 18:43:37,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {3146#true} assume ~id2~0 >= 0; {3146#true} is VALID [2022-02-20 18:43:37,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {3146#true} assume 0 == ~st2~0; {3146#true} is VALID [2022-02-20 18:43:37,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {3146#true} assume ~send2~0 == ~id2~0; {3146#true} is VALID [2022-02-20 18:43:37,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {3146#true} assume 0 == ~mode2~0 % 256; {3146#true} is VALID [2022-02-20 18:43:37,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {3146#true} assume ~id3~0 >= 0; {3146#true} is VALID [2022-02-20 18:43:37,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {3146#true} assume 0 == ~st3~0; {3146#true} is VALID [2022-02-20 18:43:37,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {3146#true} assume ~send3~0 == ~id3~0; {3146#true} is VALID [2022-02-20 18:43:37,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {3146#true} assume 0 == ~mode3~0 % 256; {3146#true} is VALID [2022-02-20 18:43:37,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {3146#true} assume ~id1~0 != ~id2~0; {3146#true} is VALID [2022-02-20 18:43:37,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {3146#true} assume ~id1~0 != ~id3~0; {3146#true} is VALID [2022-02-20 18:43:37,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {3146#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {3146#true} is VALID [2022-02-20 18:43:37,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {3146#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; {3146#true} is VALID [2022-02-20 18:43:37,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {3146#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3146#true} is VALID [2022-02-20 18:43:37,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {3146#true} assume !!(0 == ~mode1~0 % 256); {3146#true} is VALID [2022-02-20 18:43:37,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {3146#true} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3146#true} is VALID [2022-02-20 18:43:37,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {3146#true} 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; {3146#true} is VALID [2022-02-20 18:43:37,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {3146#true} assume !!(0 == ~mode2~0 % 256); {3146#true} is VALID [2022-02-20 18:43:37,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {3146#true} assume !!(0 == ~alive2~0 % 256); {3146#true} is VALID [2022-02-20 18:43:37,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {3146#true} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {3146#true} is VALID [2022-02-20 18:43:37,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {3146#true} assume !!(0 == ~mode3~0 % 256); {3146#true} is VALID [2022-02-20 18:43:37,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {3146#true} assume !!(0 == ~alive3~0 % 256); {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {3148#(= (+ (* (- 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~40#1; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 < 3;main_~check__tmp~40#1 := 1;~__return_7217~0 := main_~check__tmp~40#1;main_~main__c1~0#1 := ~__return_7217~0;havoc main_~__tmp_40~0#1;main_~__tmp_40~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~39#1;main_~assert__arg~39#1 := main_~__tmp_40~0#1; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == main_~assert__arg~39#1 % 256);main_~main____CPAchecker_TMP_0~36#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6431_0~0 := main_~main____CPAchecker_TMP_0~36#1; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {3148#(= (+ (* (- 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; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {3148#(= (+ (* (- 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; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive1~0 % 256); {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 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; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~4#1 != ~nomsg~0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:37,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {3147#false} is VALID [2022-02-20 18:43:37,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {3147#false} assume !(main_~node3__m3~4#1 > ~id3~0); {3147#false} is VALID [2022-02-20 18:43:37,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {3147#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; {3147#false} is VALID [2022-02-20 18:43:37,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {3147#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7038~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7038~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; {3147#false} is VALID [2022-02-20 18:43:37,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {3147#false} assume 0 == main_~assert__arg~7#1 % 256; {3147#false} is VALID [2022-02-20 18:43:37,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {3147#false} assume !false; {3147#false} is VALID [2022-02-20 18:43:37,620 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:43:37,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:37,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814212290] [2022-02-20 18:43:37,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814212290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:37,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:37,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:37,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279514808] [2022-02-20 18:43:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:37,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:37,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:37,654 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:43:37,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:37,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:37,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:37,658 INFO L87 Difference]: Start difference. First operand 565 states and 754 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:38,304 INFO L93 Difference]: Finished difference Result 994 states and 1379 transitions. [2022-02-20 18:43:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:38,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2022-02-20 18:43:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2022-02-20 18:43:38,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 951 transitions. [2022-02-20 18:43:38,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:38,952 INFO L225 Difference]: With dead ends: 994 [2022-02-20 18:43:38,952 INFO L226 Difference]: Without dead ends: 781 [2022-02-20 18:43:38,954 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:43:38,954 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 314 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1017 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:43:38,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1017 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-02-20 18:43:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 774. [2022-02-20 18:43:38,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:38,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 781 states. Second operand has 774 states, 770 states have (on average 1.3714285714285714) internal successors, (1056), 773 states have internal predecessors, (1056), 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:43:39,002 INFO L74 IsIncluded]: Start isIncluded. First operand 781 states. Second operand has 774 states, 770 states have (on average 1.3714285714285714) internal successors, (1056), 773 states have internal predecessors, (1056), 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:43:39,004 INFO L87 Difference]: Start difference. First operand 781 states. Second operand has 774 states, 770 states have (on average 1.3714285714285714) internal successors, (1056), 773 states have internal predecessors, (1056), 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:43:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:39,024 INFO L93 Difference]: Finished difference Result 781 states and 1061 transitions. [2022-02-20 18:43:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1061 transitions. [2022-02-20 18:43:39,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:39,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:39,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 774 states, 770 states have (on average 1.3714285714285714) internal successors, (1056), 773 states have internal predecessors, (1056), 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 781 states. [2022-02-20 18:43:39,027 INFO L87 Difference]: Start difference. First operand has 774 states, 770 states have (on average 1.3714285714285714) internal successors, (1056), 773 states have internal predecessors, (1056), 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 781 states. [2022-02-20 18:43:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:39,047 INFO L93 Difference]: Finished difference Result 781 states and 1061 transitions. [2022-02-20 18:43:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1061 transitions. [2022-02-20 18:43:39,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:39,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:39,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:39,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 770 states have (on average 1.3714285714285714) internal successors, (1056), 773 states have internal predecessors, (1056), 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:43:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1056 transitions. [2022-02-20 18:43:39,072 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1056 transitions. Word has length 51 [2022-02-20 18:43:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:39,073 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1056 transitions. [2022-02-20 18:43:39,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:43:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1056 transitions. [2022-02-20 18:43:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:43:39,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:39,075 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:43:39,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:43:39,075 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1493728400, now seen corresponding path program 1 times [2022-02-20 18:43:39,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:39,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439095983] [2022-02-20 18:43:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:39,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {6894#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {6896#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:39,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {6896#(<= (+ ~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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {6896#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:39,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {6896#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {6896#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:39,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {6896#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {6896#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:39,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {6896#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {6897#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:39,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {6897#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {6897#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:39,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {6897#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {6898#(<= (+ ~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; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {6898#(<= (+ ~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; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:39,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {6898#(<= (+ ~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; {6895#false} is VALID [2022-02-20 18:43:39,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {6895#false} assume !!(0 == ~mode2~0 % 256); {6895#false} is VALID [2022-02-20 18:43:39,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {6895#false} assume !!(0 == ~alive2~0 % 256); {6895#false} is VALID [2022-02-20 18:43:39,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {6895#false} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {6895#false} is VALID [2022-02-20 18:43:39,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {6895#false} assume !!(0 == ~mode3~0 % 256); {6895#false} is VALID [2022-02-20 18:43:39,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {6895#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~8#1; {6895#false} is VALID [2022-02-20 18:43:39,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {6895#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; {6895#false} is VALID [2022-02-20 18:43:39,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {6895#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6895#false} is VALID [2022-02-20 18:43:39,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {6895#false} assume ~r1~0 < 3;main_~check__tmp~38#1 := 1;~__return_7154~0 := main_~check__tmp~38#1;main_~main__c1~0#1 := ~__return_7154~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; {6895#false} is VALID [2022-02-20 18:43:39,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {6895#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_6431_0~0 := main_~main____CPAchecker_TMP_0~34#1; {6895#false} is VALID [2022-02-20 18:43:39,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {6895#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {6895#false} is VALID [2022-02-20 18:43:39,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {6895#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6895#false} is VALID [2022-02-20 18:43:39,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {6895#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; {6895#false} is VALID [2022-02-20 18:43:39,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {6895#false} assume main_~node1__m1~1#1 != ~nomsg~0; {6895#false} is VALID [2022-02-20 18:43:39,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {6895#false} assume !(0 == ~alive1~0 % 256); {6895#false} is VALID [2022-02-20 18:43:39,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {6895#false} assume !(main_~node1__m1~1#1 > ~id1~0); {6895#false} is VALID [2022-02-20 18:43:39,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {6895#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; {6895#false} is VALID [2022-02-20 18:43:39,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {6895#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6895#false} is VALID [2022-02-20 18:43:39,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {6895#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6895#false} is VALID [2022-02-20 18:43:39,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {6895#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6895#false} is VALID [2022-02-20 18:43:39,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {6895#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6895#false} is VALID [2022-02-20 18:43:39,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {6895#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6895#false} is VALID [2022-02-20 18:43:39,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {6895#false} assume !(0 == ~alive3~0 % 256); {6895#false} is VALID [2022-02-20 18:43:39,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {6895#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6895#false} is VALID [2022-02-20 18:43:39,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {6895#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; {6895#false} is VALID [2022-02-20 18:43:39,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {6895#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7038~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7038~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; {6895#false} is VALID [2022-02-20 18:43:39,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {6895#false} assume 0 == main_~assert__arg~7#1 % 256; {6895#false} is VALID [2022-02-20 18:43:39,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {6895#false} assume !false; {6895#false} is VALID [2022-02-20 18:43:39,170 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:43:39,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:39,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439095983] [2022-02-20 18:43:39,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439095983] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:39,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:39,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:43:39,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228118401] [2022-02-20 18:43:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:39,172 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:43:39,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:39,173 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:43:39,208 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:43:39,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:39,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:39,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:39,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:39,210 INFO L87 Difference]: Start difference. First operand 774 states and 1056 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:43:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:40,740 INFO L93 Difference]: Finished difference Result 1720 states and 2419 transitions. [2022-02-20 18:43:40,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:40,740 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:43:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:40,741 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:43:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1109 transitions. [2022-02-20 18:43:40,746 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:43:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1109 transitions. [2022-02-20 18:43:40,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1109 transitions. [2022-02-20 18:43:41,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1109 edges. 1109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:41,504 INFO L225 Difference]: With dead ends: 1720 [2022-02-20 18:43:41,504 INFO L226 Difference]: Without dead ends: 1063 [2022-02-20 18:43:41,505 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:43:41,506 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1730 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:41,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1730 Valid, 392 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:43:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-02-20 18:43:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1057. [2022-02-20 18:43:41,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:41,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1063 states. Second operand has 1057 states, 1053 states have (on average 1.4074074074074074) internal successors, (1482), 1056 states have internal predecessors, (1482), 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:43:41,870 INFO L74 IsIncluded]: Start isIncluded. First operand 1063 states. Second operand has 1057 states, 1053 states have (on average 1.4074074074074074) internal successors, (1482), 1056 states have internal predecessors, (1482), 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:43:41,872 INFO L87 Difference]: Start difference. First operand 1063 states. Second operand has 1057 states, 1053 states have (on average 1.4074074074074074) internal successors, (1482), 1056 states have internal predecessors, (1482), 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:43:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:41,910 INFO L93 Difference]: Finished difference Result 1063 states and 1486 transitions. [2022-02-20 18:43:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1486 transitions. [2022-02-20 18:43:41,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:41,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:41,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 1057 states, 1053 states have (on average 1.4074074074074074) internal successors, (1482), 1056 states have internal predecessors, (1482), 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 1063 states. [2022-02-20 18:43:41,915 INFO L87 Difference]: Start difference. First operand has 1057 states, 1053 states have (on average 1.4074074074074074) internal successors, (1482), 1056 states have internal predecessors, (1482), 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 1063 states. [2022-02-20 18:43:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:41,966 INFO L93 Difference]: Finished difference Result 1063 states and 1486 transitions. [2022-02-20 18:43:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1486 transitions. [2022-02-20 18:43:41,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:41,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:41,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:41,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1053 states have (on average 1.4074074074074074) internal successors, (1482), 1056 states have internal predecessors, (1482), 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:43:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1482 transitions. [2022-02-20 18:43:42,016 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1482 transitions. Word has length 51 [2022-02-20 18:43:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:42,017 INFO L470 AbstractCegarLoop]: Abstraction has 1057 states and 1482 transitions. [2022-02-20 18:43:42,017 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:43:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1482 transitions. [2022-02-20 18:43:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:43:42,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:42,020 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:43:42,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:43:42,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash -358090099, now seen corresponding path program 1 times [2022-02-20 18:43:42,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:42,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805264327] [2022-02-20 18:43:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:42,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {12572#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {12572#true} is VALID [2022-02-20 18:43:42,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {12572#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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {12572#true} is VALID [2022-02-20 18:43:42,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {12572#true} assume 0 == ~r1~0; {12572#true} is VALID [2022-02-20 18:43:42,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {12572#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {12572#true} is VALID [2022-02-20 18:43:42,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {12572#true} assume ~id1~0 >= 0; {12572#true} is VALID [2022-02-20 18:43:42,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {12572#true} assume 0 == ~st1~0; {12572#true} is VALID [2022-02-20 18:43:42,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {12572#true} assume ~send1~0 == ~id1~0; {12572#true} is VALID [2022-02-20 18:43:42,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {12572#true} assume 0 == ~mode1~0 % 256; {12572#true} is VALID [2022-02-20 18:43:42,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {12572#true} assume ~id2~0 >= 0; {12572#true} is VALID [2022-02-20 18:43:42,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {12572#true} assume 0 == ~st2~0; {12572#true} is VALID [2022-02-20 18:43:42,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {12572#true} assume ~send2~0 == ~id2~0; {12572#true} is VALID [2022-02-20 18:43:42,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {12572#true} assume 0 == ~mode2~0 % 256; {12572#true} is VALID [2022-02-20 18:43:42,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {12572#true} assume ~id3~0 >= 0; {12572#true} is VALID [2022-02-20 18:43:42,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {12572#true} assume 0 == ~st3~0; {12572#true} is VALID [2022-02-20 18:43:42,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {12572#true} assume ~send3~0 == ~id3~0; {12572#true} is VALID [2022-02-20 18:43:42,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {12572#true} assume 0 == ~mode3~0 % 256; {12572#true} is VALID [2022-02-20 18:43:42,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {12572#true} assume ~id1~0 != ~id2~0; {12572#true} is VALID [2022-02-20 18:43:42,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {12572#true} assume ~id1~0 != ~id3~0; {12572#true} is VALID [2022-02-20 18:43:42,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {12572#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {12572#true} is VALID [2022-02-20 18:43:42,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {12572#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; {12572#true} is VALID [2022-02-20 18:43:42,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {12572#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12572#true} is VALID [2022-02-20 18:43:42,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {12572#true} assume !!(0 == ~mode1~0 % 256); {12572#true} is VALID [2022-02-20 18:43:42,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {12572#true} assume !!(0 == ~alive1~0 % 256); {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {12574#(= (+ ~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; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~12#1; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~12#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~12#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~12#1 % 256 else main_~node3____CPAchecker_TMP_0~12#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~54#1; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 < 3;main_~check__tmp~54#1 := 1;~__return_8558~0 := main_~check__tmp~54#1;main_~main__c1~0#1 := ~__return_8558~0;havoc main_~__tmp_54~0#1;main_~__tmp_54~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~53#1;main_~assert__arg~53#1 := main_~__tmp_54~0#1; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == main_~assert__arg~53#1 % 256);main_~main____CPAchecker_TMP_0~50#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6431_0~0 := main_~main____CPAchecker_TMP_0~50#1; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {12574#(= (+ ~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; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {12574#(= (+ ~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; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:42,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {12574#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {12573#false} is VALID [2022-02-20 18:43:42,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {12573#false} assume !(main_~node1__m1~1#1 > ~id1~0); {12573#false} is VALID [2022-02-20 18:43:42,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {12573#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; {12573#false} is VALID [2022-02-20 18:43:42,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {12573#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12573#false} is VALID [2022-02-20 18:43:42,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {12573#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {12573#false} is VALID [2022-02-20 18:43:42,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {12573#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {12573#false} is VALID [2022-02-20 18:43:42,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {12573#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12573#false} is VALID [2022-02-20 18:43:42,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {12573#false} assume main_~node3__m3~4#1 != ~nomsg~0; {12573#false} is VALID [2022-02-20 18:43:42,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {12573#false} assume !(0 == ~alive3~0 % 256); {12573#false} is VALID [2022-02-20 18:43:42,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {12573#false} assume !(main_~node3__m3~4#1 > ~id3~0); {12573#false} is VALID [2022-02-20 18:43:42,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {12573#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; {12573#false} is VALID [2022-02-20 18:43:42,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {12573#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7038~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7038~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; {12573#false} is VALID [2022-02-20 18:43:42,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {12573#false} assume 0 == main_~assert__arg~7#1 % 256; {12573#false} is VALID [2022-02-20 18:43:42,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {12573#false} assume !false; {12573#false} is VALID [2022-02-20 18:43:42,130 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:43:42,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:42,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805264327] [2022-02-20 18:43:42,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805264327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:42,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:42,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:42,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052504575] [2022-02-20 18:43:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:43:42,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:42,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:43:42,168 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:43:42,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:42,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:42,170 INFO L87 Difference]: Start difference. First operand 1057 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:43:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:43,551 INFO L93 Difference]: Finished difference Result 2561 states and 3637 transitions. [2022-02-20 18:43:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:43,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:43:43,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:43:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2022-02-20 18:43:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:43:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2022-02-20 18:43:43,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 962 transitions. [2022-02-20 18:43:44,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 962 edges. 962 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:44,277 INFO L225 Difference]: With dead ends: 2561 [2022-02-20 18:43:44,277 INFO L226 Difference]: Without dead ends: 1730 [2022-02-20 18:43:44,278 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:43:44,279 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 364 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 933 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:43:44,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 933 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-02-20 18:43:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1716. [2022-02-20 18:43:44,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:44,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1730 states. Second operand has 1716 states, 1712 states have (on average 1.3919392523364487) internal successors, (2383), 1715 states have internal predecessors, (2383), 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:43:44,810 INFO L74 IsIncluded]: Start isIncluded. First operand 1730 states. Second operand has 1716 states, 1712 states have (on average 1.3919392523364487) internal successors, (2383), 1715 states have internal predecessors, (2383), 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:43:44,812 INFO L87 Difference]: Start difference. First operand 1730 states. Second operand has 1716 states, 1712 states have (on average 1.3919392523364487) internal successors, (2383), 1715 states have internal predecessors, (2383), 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:43:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:44,893 INFO L93 Difference]: Finished difference Result 1730 states and 2395 transitions. [2022-02-20 18:43:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2395 transitions. [2022-02-20 18:43:44,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:44,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:44,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 1716 states, 1712 states have (on average 1.3919392523364487) internal successors, (2383), 1715 states have internal predecessors, (2383), 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 1730 states. [2022-02-20 18:43:44,901 INFO L87 Difference]: Start difference. First operand has 1716 states, 1712 states have (on average 1.3919392523364487) internal successors, (2383), 1715 states have internal predecessors, (2383), 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 1730 states. [2022-02-20 18:43:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:44,988 INFO L93 Difference]: Finished difference Result 1730 states and 2395 transitions. [2022-02-20 18:43:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2395 transitions. [2022-02-20 18:43:44,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:44,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:44,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:44,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1712 states have (on average 1.3919392523364487) internal successors, (2383), 1715 states have internal predecessors, (2383), 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:43:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2383 transitions. [2022-02-20 18:43:45,110 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2383 transitions. Word has length 52 [2022-02-20 18:43:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:45,111 INFO L470 AbstractCegarLoop]: Abstraction has 1716 states and 2383 transitions. [2022-02-20 18:43:45,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:43:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2383 transitions. [2022-02-20 18:43:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:43:45,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:45,112 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:43:45,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:43:45,113 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1296606516, now seen corresponding path program 1 times [2022-02-20 18:43:45,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:45,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039493324] [2022-02-20 18:43:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:45,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {21614#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {21616#(<= (+ ~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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {21616#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {21616#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {21616#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {21616#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {21616#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {21616#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {21616#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:45,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {21616#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {21617#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:43:45,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {21617#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {21617#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:43:45,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {21617#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {21618#(<= (+ ~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; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {21618#(<= (+ ~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; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {21618#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {21618#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:45,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {21618#(<= (+ ~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; {21615#false} is VALID [2022-02-20 18:43:45,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {21615#false} assume !!(0 == ~mode3~0 % 256); {21615#false} is VALID [2022-02-20 18:43:45,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {21615#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~10#1; {21615#false} is VALID [2022-02-20 18:43:45,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {21615#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; {21615#false} is VALID [2022-02-20 18:43:45,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {21615#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21615#false} is VALID [2022-02-20 18:43:45,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {21615#false} assume ~r1~0 < 3;main_~check__tmp~46#1 := 1;~__return_8265~0 := main_~check__tmp~46#1;main_~main__c1~0#1 := ~__return_8265~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; {21615#false} is VALID [2022-02-20 18:43:45,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {21615#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_6431_0~0 := main_~main____CPAchecker_TMP_0~42#1; {21615#false} is VALID [2022-02-20 18:43:45,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {21615#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {21615#false} is VALID [2022-02-20 18:43:45,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {21615#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21615#false} is VALID [2022-02-20 18:43:45,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {21615#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; {21615#false} is VALID [2022-02-20 18:43:45,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {21615#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {21615#false} is VALID [2022-02-20 18:43:45,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {21615#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21615#false} is VALID [2022-02-20 18:43:45,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {21615#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21615#false} is VALID [2022-02-20 18:43:45,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {21615#false} assume main_~node2__m2~1#1 != ~nomsg~0; {21615#false} is VALID [2022-02-20 18:43:45,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {21615#false} assume !(0 == ~alive2~0 % 256); {21615#false} is VALID [2022-02-20 18:43:45,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {21615#false} assume !(main_~node2__m2~1#1 > ~id2~0); {21615#false} is VALID [2022-02-20 18:43:45,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {21615#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; {21615#false} is VALID [2022-02-20 18:43:45,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {21615#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21615#false} is VALID [2022-02-20 18:43:45,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {21615#false} assume main_~node3__m3~3#1 != ~nomsg~0; {21615#false} is VALID [2022-02-20 18:43:45,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {21615#false} assume !(0 == ~alive3~0 % 256); {21615#false} is VALID [2022-02-20 18:43:45,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {21615#false} assume !(main_~node3__m3~3#1 > ~id3~0); {21615#false} is VALID [2022-02-20 18:43:45,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {21615#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; {21615#false} is VALID [2022-02-20 18:43:45,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {21615#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7768~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7768~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; {21615#false} is VALID [2022-02-20 18:43:45,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {21615#false} assume 0 == main_~assert__arg~5#1 % 256; {21615#false} is VALID [2022-02-20 18:43:45,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {21615#false} assume !false; {21615#false} is VALID [2022-02-20 18:43:45,188 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:43:45,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:45,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039493324] [2022-02-20 18:43:45,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039493324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:45,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:45,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:43:45,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036365820] [2022-02-20 18:43:45,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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:43:45,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:45,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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:43:45,218 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:43:45,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:45,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:45,220 INFO L87 Difference]: Start difference. First operand 1716 states and 2383 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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:43:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:48,109 INFO L93 Difference]: Finished difference Result 3785 states and 5312 transitions. [2022-02-20 18:43:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:48,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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:43:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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:43:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2022-02-20 18:43:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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:43:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2022-02-20 18:43:48,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 917 transitions. [2022-02-20 18:43:48,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 917 edges. 917 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:48,738 INFO L225 Difference]: With dead ends: 3785 [2022-02-20 18:43:48,738 INFO L226 Difference]: Without dead ends: 2241 [2022-02-20 18:43:48,740 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:43:48,741 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 1531 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:48,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1531 Valid, 367 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:43:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2022-02-20 18:43:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2227. [2022-02-20 18:43:49,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:49,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2241 states. Second operand has 2227 states, 2223 states have (on average 1.3967611336032388) internal successors, (3105), 2226 states have internal predecessors, (3105), 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:43:49,838 INFO L74 IsIncluded]: Start isIncluded. First operand 2241 states. Second operand has 2227 states, 2223 states have (on average 1.3967611336032388) internal successors, (3105), 2226 states have internal predecessors, (3105), 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:43:49,840 INFO L87 Difference]: Start difference. First operand 2241 states. Second operand has 2227 states, 2223 states have (on average 1.3967611336032388) internal successors, (3105), 2226 states have internal predecessors, (3105), 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:43:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:49,963 INFO L93 Difference]: Finished difference Result 2241 states and 3117 transitions. [2022-02-20 18:43:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3117 transitions. [2022-02-20 18:43:49,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:49,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:49,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 2227 states, 2223 states have (on average 1.3967611336032388) internal successors, (3105), 2226 states have internal predecessors, (3105), 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 2241 states. [2022-02-20 18:43:49,970 INFO L87 Difference]: Start difference. First operand has 2227 states, 2223 states have (on average 1.3967611336032388) internal successors, (3105), 2226 states have internal predecessors, (3105), 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 2241 states. [2022-02-20 18:43:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:50,103 INFO L93 Difference]: Finished difference Result 2241 states and 3117 transitions. [2022-02-20 18:43:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3117 transitions. [2022-02-20 18:43:50,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:50,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:50,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:50,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2223 states have (on average 1.3967611336032388) internal successors, (3105), 2226 states have internal predecessors, (3105), 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:43:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3105 transitions. [2022-02-20 18:43:50,306 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3105 transitions. Word has length 52 [2022-02-20 18:43:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:50,306 INFO L470 AbstractCegarLoop]: Abstraction has 2227 states and 3105 transitions. [2022-02-20 18:43:50,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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:43:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3105 transitions. [2022-02-20 18:43:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:43:50,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:50,308 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:43:50,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:43:50,308 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:50,309 INFO L85 PathProgramCache]: Analyzing trace with hash -482685133, now seen corresponding path program 1 times [2022-02-20 18:43:50,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:50,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076784274] [2022-02-20 18:43:50,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:50,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:50,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {34062#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {34064#(<= (+ ~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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {34064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:50,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {34064#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {34065#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:43:50,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {34065#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {34065#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:43:50,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {34065#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {34066#(<= (+ ~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; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {34066#(<= (+ ~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; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~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); {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {34066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:43:50,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {34066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~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~22#1; {34063#false} is VALID [2022-02-20 18:43:50,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {34063#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34063#false} is VALID [2022-02-20 18:43:50,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {34063#false} assume ~r1~0 < 3;main_~check__tmp~22#1 := 1;~__return_7952~0 := main_~check__tmp~22#1;main_~main__c1~0#1 := ~__return_7952~0;havoc main_~__tmp_22~0#1;main_~__tmp_22~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~21#1;main_~assert__arg~21#1 := main_~__tmp_22~0#1; {34063#false} is VALID [2022-02-20 18:43:50,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {34063#false} assume !(0 == main_~assert__arg~21#1 % 256);main_~main____CPAchecker_TMP_0~18#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_6431_0~0 := main_~main____CPAchecker_TMP_0~18#1; {34063#false} is VALID [2022-02-20 18:43:50,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {34063#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {34063#false} is VALID [2022-02-20 18:43:50,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {34063#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {34063#false} is VALID [2022-02-20 18:43:50,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {34063#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; {34063#false} is VALID [2022-02-20 18:43:50,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {34063#false} assume main_~node1__m1~1#1 != ~nomsg~0; {34063#false} is VALID [2022-02-20 18:43:50,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {34063#false} assume !(0 == ~alive1~0 % 256); {34063#false} is VALID [2022-02-20 18:43:50,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {34063#false} assume !(main_~node1__m1~1#1 > ~id1~0); {34063#false} is VALID [2022-02-20 18:43:50,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {34063#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; {34063#false} is VALID [2022-02-20 18:43:50,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {34063#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {34063#false} is VALID [2022-02-20 18:43:50,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {34063#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {34063#false} is VALID [2022-02-20 18:43:50,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {34063#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {34063#false} is VALID [2022-02-20 18:43:50,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {34063#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {34063#false} is VALID [2022-02-20 18:43:50,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {34063#false} assume main_~node3__m3~4#1 != ~nomsg~0; {34063#false} is VALID [2022-02-20 18:43:50,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {34063#false} assume !(0 == ~alive3~0 % 256); {34063#false} is VALID [2022-02-20 18:43:50,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {34063#false} assume !(main_~node3__m3~4#1 > ~id3~0); {34063#false} is VALID [2022-02-20 18:43:50,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {34063#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; {34063#false} is VALID [2022-02-20 18:43:50,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {34063#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7038~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7038~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; {34063#false} is VALID [2022-02-20 18:43:50,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {34063#false} assume 0 == main_~assert__arg~7#1 % 256; {34063#false} is VALID [2022-02-20 18:43:50,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {34063#false} assume !false; {34063#false} is VALID [2022-02-20 18:43:50,383 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:43:50,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:50,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076784274] [2022-02-20 18:43:50,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076784274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:50,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:50,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:43:50,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710361746] [2022-02-20 18:43:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:43:50,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:50,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:43:50,419 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:43:50,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:50,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:50,420 INFO L87 Difference]: Start difference. First operand 2227 states and 3105 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:43:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:54,659 INFO L93 Difference]: Finished difference Result 5040 states and 7066 transitions. [2022-02-20 18:43:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:43:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:43:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 816 transitions. [2022-02-20 18:43:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:43:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 816 transitions. [2022-02-20 18:43:54,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 816 transitions. [2022-02-20 18:43:55,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 816 edges. 816 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:55,482 INFO L225 Difference]: With dead ends: 5040 [2022-02-20 18:43:55,482 INFO L226 Difference]: Without dead ends: 2985 [2022-02-20 18:43:55,484 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:43:55,485 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1376 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:55,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1376 Valid, 335 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:43:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2022-02-20 18:43:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2966. [2022-02-20 18:43:57,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:57,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2985 states. Second operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 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:43:57,856 INFO L74 IsIncluded]: Start isIncluded. First operand 2985 states. Second operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 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:43:57,858 INFO L87 Difference]: Start difference. First operand 2985 states. Second operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 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:43:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,071 INFO L93 Difference]: Finished difference Result 2985 states and 4135 transitions. [2022-02-20 18:43:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4135 transitions. [2022-02-20 18:43:58,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:58,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:58,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 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 2985 states. [2022-02-20 18:43:58,079 INFO L87 Difference]: Start difference. First operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 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 2985 states. [2022-02-20 18:43:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,306 INFO L93 Difference]: Finished difference Result 2985 states and 4135 transitions. [2022-02-20 18:43:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4135 transitions. [2022-02-20 18:43:58,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:58,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:58,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:58,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 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:43:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4118 transitions. [2022-02-20 18:43:58,694 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4118 transitions. Word has length 53 [2022-02-20 18:43:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:58,695 INFO L470 AbstractCegarLoop]: Abstraction has 2966 states and 4118 transitions. [2022-02-20 18:43:58,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:43:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4118 transitions. [2022-02-20 18:43:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:43:58,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:58,697 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, 1] [2022-02-20 18:43:58,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:43:58,697 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1630046103, now seen corresponding path program 1 times [2022-02-20 18:43:58,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:58,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219433038] [2022-02-20 18:43:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:58,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {50824#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {50826#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:58,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {50826#(<= (+ ~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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {50826#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:58,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {50826#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {50826#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:58,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {50826#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {50826#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:58,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {50826#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode1~0 % 256; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 >= 0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st2~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send2~0 == ~id2~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode2~0 % 256; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id3~0 >= 0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st3~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send3~0 == ~id3~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode3~0 % 256; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id2~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id3~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {50827#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {50827#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {50827#(<= (+ ~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; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {50828#(<= (+ ~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; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode1~0 % 256); {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send1~0 != ~nomsg~0; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {50828#(<= (+ ~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); {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode2~0 % 256); {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send2~0 != ~nomsg~0; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {50828#(<= (+ ~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; {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode3~0 % 256); {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {50828#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~alive3~0 % 256); {50828#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {50828#(<= (+ ~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; {50829#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {50829#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {50829#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {50829#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~r1~0 < 3;main_~check__tmp~12#1 := 1;~__return_7869~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_7869~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; {50829#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {50829#(<= (+ ~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_6431_0~0 := main_~main____CPAchecker_TMP_0~8#1; {50829#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {50829#(<= (+ ~p3_old~0 1) ~id1~0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {50829#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {50829#(<= (+ ~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; {50829#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:43:58,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {50829#(<= (+ ~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; {50830#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:43:58,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {50830#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {50830#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:43:58,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {50830#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(0 == ~alive1~0 % 256); {50830#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:43:58,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {50830#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {50830#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:43:58,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {50830#(<= (+ |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; {50825#false} is VALID [2022-02-20 18:43:58,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {50825#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {50825#false} is VALID [2022-02-20 18:43:58,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {50825#false} assume main_~node2__m2~3#1 != ~nomsg~0; {50825#false} is VALID [2022-02-20 18:43:58,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {50825#false} assume !(0 == ~alive2~0 % 256); {50825#false} is VALID [2022-02-20 18:43:58,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {50825#false} assume !(main_~node2__m2~3#1 > ~id2~0); {50825#false} is VALID [2022-02-20 18:43:58,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {50825#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; {50825#false} is VALID [2022-02-20 18:43:58,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {50825#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {50825#false} is VALID [2022-02-20 18:43:58,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {50825#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {50825#false} is VALID [2022-02-20 18:43:58,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {50825#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; {50825#false} is VALID [2022-02-20 18:43:58,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {50825#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_7611~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_7611~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; {50825#false} is VALID [2022-02-20 18:43:58,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {50825#false} assume 0 == main_~assert__arg~8#1 % 256; {50825#false} is VALID [2022-02-20 18:43:58,782 INFO L290 TraceCheckUtils]: 53: Hoare triple {50825#false} assume !false; {50825#false} is VALID [2022-02-20 18:43:58,782 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:43:58,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:58,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219433038] [2022-02-20 18:43:58,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219433038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:58,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:58,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:43:58,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895763993] [2022-02-20 18:43:58,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:58,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2022-02-20 18:43:58,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:58,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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:43:58,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:58,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:43:58,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:58,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:43:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:43:58,815 INFO L87 Difference]: Start difference. First operand 2966 states and 4118 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:13,748 INFO L93 Difference]: Finished difference Result 9648 states and 13611 transitions. [2022-02-20 18:44:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:44:13,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2022-02-20 18:44:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 941 transitions. [2022-02-20 18:44:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 941 transitions. [2022-02-20 18:44:13,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 941 transitions. [2022-02-20 18:44:14,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 941 edges. 941 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:17,480 INFO L225 Difference]: With dead ends: 9648 [2022-02-20 18:44:17,481 INFO L226 Difference]: Without dead ends: 8327 [2022-02-20 18:44:17,498 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:17,502 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 2727 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:17,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2727 Valid, 599 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:44:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2022-02-20 18:44:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 2980. [2022-02-20 18:44:21,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:21,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8327 states. Second operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 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:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand 8327 states. Second operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 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:21,146 INFO L87 Difference]: Start difference. First operand 8327 states. Second operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 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:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:22,938 INFO L93 Difference]: Finished difference Result 8327 states and 11740 transitions. [2022-02-20 18:44:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 11740 transitions. [2022-02-20 18:44:22,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:22,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:22,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 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 8327 states. [2022-02-20 18:44:22,951 INFO L87 Difference]: Start difference. First operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 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 8327 states. [2022-02-20 18:44:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:24,770 INFO L93 Difference]: Finished difference Result 8327 states and 11740 transitions. [2022-02-20 18:44:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 11740 transitions. [2022-02-20 18:44:24,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:24,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:24,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:24,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 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,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4136 transitions. [2022-02-20 18:44:25,153 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4136 transitions. Word has length 54 [2022-02-20 18:44:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:25,153 INFO L470 AbstractCegarLoop]: Abstraction has 2980 states and 4136 transitions. [2022-02-20 18:44:25,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4136 transitions. [2022-02-20 18:44:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:44:25,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:25,155 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, 1] [2022-02-20 18:44:25,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:25,155 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:25,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1470909546, now seen corresponding path program 1 times [2022-02-20 18:44:25,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:25,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539158422] [2022-02-20 18:44:25,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:25,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:25,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {85034#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_6343~0 := 0;~__return_7802~0 := 0;~__tmp_6431_0~0 := 0;~__return_6484~0 := 0;~__tmp_6494_0~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6961~0 := 0;~__return_7522~0 := 0;~__return_7768~0 := 0;~__return_6779~0 := 0;~__return_7038~0 := 0;~__return_7611~0 := 0;~__return_7842~0 := 0;~__return_7728~0 := 0;~__return_7903~0 := 0;~__return_7869~0 := 0;~__return_7559~0 := 0;~__return_7468~0 := 0;~__return_7678~0 := 0;~__return_7644~0 := 0;~__return_8133~0 := 0;~__return_8101~0 := 0;~__return_8198~0 := 0;~__return_8164~0 := 0;~__return_7984~0 := 0;~__return_7952~0 := 0;~__return_8049~0 := 0;~__return_8015~0 := 0;~__return_6998~0 := 0;~__return_6919~0 := 0;~__return_7105~0 := 0;~__return_7071~0 := 0;~__return_6712~0 := 0;~__return_6421~0 := 0;~__return_6869~0 := 0;~__return_6835~0 := 0;~__return_7335~0 := 0;~__return_7303~0 := 0;~__return_7400~0 := 0;~__return_7366~0 := 0;~__return_7186~0 := 0;~__return_7154~0 := 0;~__return_7251~0 := 0;~__return_7217~0 := 0;~__return_8444~0 := 0;~__return_8412~0 := 0;~__return_8509~0 := 0;~__return_8475~0 := 0;~__return_8297~0 := 0;~__return_8265~0 := 0;~__return_8362~0 := 0;~__return_8328~0 := 0;~__return_8739~0 := 0;~__return_8707~0 := 0;~__return_8804~0 := 0;~__return_8770~0 := 0;~__return_8590~0 := 0;~__return_8558~0 := 0;~__return_8655~0 := 0;~__return_8621~0 := 0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {85036#(<= (+ ~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____CPAchecker_TMP_1~0#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____CPAchecker_TMP_1~1#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____CPAchecker_TMP_1~2#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; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {85036#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:25,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {85036#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {85037#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {85037#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {85037#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {85037#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {85037#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {85037#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~mode3~0 % 256; {85037#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {85037#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id2~0; {85037#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {85037#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id3~0; {85037#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {85037#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {85037#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {85037#(<= (+ ~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; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {85038#(<= (+ ~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; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode1~0 % 256); {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send1~0 != ~nomsg~0; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {85038#(<= (+ ~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); {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode2~0 % 256); {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~alive2~0 % 256); {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {85038#(<= (+ ~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; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode3~0 % 256); {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {85038#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send3~0 != ~nomsg~0; {85038#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {85038#(<= (+ ~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; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~r1~0 < 3;main_~check__tmp~21#1 := 1;~__return_7984~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_7984~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; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {85039#(<= (+ ~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_6431_0~0 := main_~main____CPAchecker_TMP_0~17#1; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6431_0~0; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {85039#(<= (+ ~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; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {85039#(<= (+ ~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; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256); {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {85039#(<= (+ ~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; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {85039#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:25,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {85039#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {85040#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:25,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {85040#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {85040#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:25,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {85040#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(0 == ~alive3~0 % 256); {85040#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:25,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {85040#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(main_~node3__m3~4#1 > ~id3~0); {85040#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:25,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {85040#(<= (+ |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; {85035#false} is VALID [2022-02-20 18:44:25,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {85035#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7038~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7038~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; {85035#false} is VALID [2022-02-20 18:44:25,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {85035#false} assume 0 == main_~assert__arg~7#1 % 256; {85035#false} is VALID [2022-02-20 18:44:25,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {85035#false} assume !false; {85035#false} is VALID [2022-02-20 18:44:25,257 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,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:25,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539158422] [2022-02-20 18:44:25,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539158422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:25,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:25,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:44:25,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273979599] [2022-02-20 18:44:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2022-02-20 18:44:25,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:25,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:25,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:44:25,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:44:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:25,301 INFO L87 Difference]: Start difference. First operand 2980 states and 4136 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:44,432 INFO L93 Difference]: Finished difference Result 10678 states and 15139 transitions. [2022-02-20 18:44:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:44:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2022-02-20 18:44:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 965 transitions. [2022-02-20 18:44:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 965 transitions. [2022-02-20 18:44:44,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 965 transitions.