./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.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.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 9a9140492f4e733c378f87636be646ccd8e7d2f60174537e06a80c7020d713fe --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:44:50,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:44:50,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:44:50,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:44:50,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:44:50,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:44:50,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:44:50,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:44:50,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:44:50,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:44:50,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:44:50,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:44:50,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:44:50,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:44:50,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:44:50,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:44:50,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:44:50,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:44:50,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:44:50,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:44:50,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:44:50,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:44:50,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:44:50,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:44:50,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:44:50,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:44:50,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:44:50,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:44:50,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:44:50,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:44:50,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:44:50,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:44:50,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:44:50,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:44:50,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:44:50,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:44:50,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:44:50,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:44:50,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:44:50,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:44:50,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:44:50,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:44:50,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:44:50,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:44:50,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:44:50,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:44:50,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:44:50,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:44:50,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:44:50,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:44:50,954 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:44:50,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:44:50,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:44:50,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:44:50,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:44:50,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:44:50,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:44:50,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:44:50,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:44:50,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:44:50,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:44:50,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:44:50,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:44:50,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:44:50,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:44:50,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:44:50,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:50,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:44:50,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:44:50,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:44:50,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:44:50,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:44:50,958 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:44:50,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:44:50,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:44:50,959 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 -> 9a9140492f4e733c378f87636be646ccd8e7d2f60174537e06a80c7020d713fe [2022-02-20 18:44:51,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:44:51,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:44:51,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:44:51,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:44:51,204 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:44:51,205 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:44:51,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7aa615c/9653e2d660024c21831f7a11f700eba4/FLAGbdfda190a [2022-02-20 18:44:51,682 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:44:51,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:44:51,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7aa615c/9653e2d660024c21831f7a11f700eba4/FLAGbdfda190a [2022-02-20 18:44:51,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7aa615c/9653e2d660024c21831f7a11f700eba4 [2022-02-20 18:44:51,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:44:51,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:44:51,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:51,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:44:51,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:44:51,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:51" (1/1) ... [2022-02-20 18:44:51,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217ea53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:51, skipping insertion in model container [2022-02-20 18:44:51,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:51" (1/1) ... [2022-02-20 18:44:51,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:44:51,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:44:51,921 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8635,8648] [2022-02-20 18:44:51,966 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15820,15833] [2022-02-20 18:44:51,977 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18017,18030] [2022-02-20 18:44:51,983 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19041,19054] [2022-02-20 18:44:52,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:52,120 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:44:52,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8635,8648] [2022-02-20 18:44:52,174 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15820,15833] [2022-02-20 18:44:52,182 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18017,18030] [2022-02-20 18:44:52,199 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19041,19054] [2022-02-20 18:44:52,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:52,347 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:44:52,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52 WrapperNode [2022-02-20 18:44:52,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:52,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:52,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:44:52,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:44:52,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,450 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2589 [2022-02-20 18:44:52,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:52,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:44:52,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:44:52,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:44:52,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:44:52,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:44:52,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:44:52,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:44:52,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (1/1) ... [2022-02-20 18:44:52,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:52,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:52,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:44:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:44:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:44:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:44:52,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:44:52,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:44:52,738 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:44:52,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:44:54,044 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:44:54,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:44:54,058 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:44:54,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:54 BoogieIcfgContainer [2022-02-20 18:44:54,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:44:54,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:44:54,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:44:54,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:44:54,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:44:51" (1/3) ... [2022-02-20 18:44:54,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127309e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:54, skipping insertion in model container [2022-02-20 18:44:54,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:52" (2/3) ... [2022-02-20 18:44:54,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127309e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:54, skipping insertion in model container [2022-02-20 18:44:54,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:54" (3/3) ... [2022-02-20 18:44:54,068 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:44:54,071 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:44:54,071 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 18:44:54,118 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:44:54,124 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:44:54,124 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 18:44:54,152 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:44:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:54,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:54,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:54,167 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1707798208, now seen corresponding path program 1 times [2022-02-20 18:44:54,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:54,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796241947] [2022-02-20 18:44:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:54,434 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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {460#true} is VALID [2022-02-20 18:44:54,435 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:44:54,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume 0 == ~r1~0; {460#true} is VALID [2022-02-20 18:44:54,436 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:44:54,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume ~id1~0 >= 0; {460#true} is VALID [2022-02-20 18:44:54,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume 0 == ~st1~0; {460#true} is VALID [2022-02-20 18:44:54,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#true} assume ~send1~0 == ~id1~0; {460#true} is VALID [2022-02-20 18:44:54,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} assume 0 == ~mode1~0 % 256; {460#true} is VALID [2022-02-20 18:44:54,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume ~id2~0 >= 0; {460#true} is VALID [2022-02-20 18:44:54,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} assume 0 == ~st2~0; {460#true} is VALID [2022-02-20 18:44:54,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#true} assume ~send2~0 == ~id2~0; {460#true} is VALID [2022-02-20 18:44:54,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} assume 0 == ~mode2~0 % 256; {460#true} is VALID [2022-02-20 18:44:54,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#true} assume ~id3~0 >= 0; {460#true} is VALID [2022-02-20 18:44:54,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} assume 0 == ~st3~0; {460#true} is VALID [2022-02-20 18:44:54,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#true} assume ~send3~0 == ~id3~0; {460#true} is VALID [2022-02-20 18:44:54,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {460#true} assume 0 == ~mode3~0 % 256; {460#true} is VALID [2022-02-20 18:44:54,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#true} assume ~id1~0 != ~id2~0; {460#true} is VALID [2022-02-20 18:44:54,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {460#true} assume ~id1~0 != ~id3~0; {460#true} is VALID [2022-02-20 18:44:54,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {460#true} is VALID [2022-02-20 18:44:54,439 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:44:54,439 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:44:54,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {460#true} assume !!(0 == ~mode1~0 % 256); {460#true} is VALID [2022-02-20 18:44:54,439 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:44:54,440 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:44:54,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {460#true} assume !!(0 == ~mode2~0 % 256); {460#true} is VALID [2022-02-20 18:44:54,441 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:44:54,441 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:44:54,442 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:44:54,442 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:44:54,443 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:44:54,443 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:44:54,444 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_7192~0 := main_~check__tmp~40#1;main_~main__c1~0#1 := ~__return_7192~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:44:54,445 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_6409_0~0 := main_~main____CPAchecker_TMP_0~36#1; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:54,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {462#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:54,446 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:44:54,446 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:44:54,446 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:44:54,447 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:44:54,451 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:44:54,452 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:44:54,452 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:44:54,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {461#false} assume !(main_~node2__m2~1#1 > ~id2~0); {461#false} is VALID [2022-02-20 18:44:54,453 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:44:54,453 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:44:54,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {461#false} assume main_~node3__m3~3#1 != ~nomsg~0; {461#false} is VALID [2022-02-20 18:44:54,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {461#false} assume !(0 == ~alive3~0 % 256); {461#false} is VALID [2022-02-20 18:44:54,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {461#false} assume !(main_~node3__m3~3#1 > ~id3~0); {461#false} is VALID [2022-02-20 18:44:54,454 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:44:54,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {461#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7743~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7743~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:44:54,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {461#false} assume 0 == main_~assert__arg~5#1 % 256; {461#false} is VALID [2022-02-20 18:44:54,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 18:44:54,456 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:54,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:54,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796241947] [2022-02-20 18:44:54,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796241947] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:54,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:54,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:54,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186981799] [2022-02-20 18:44:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:54,462 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:44:54,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:54,470 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:44:54,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:54,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:54,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:54,536 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:44:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:55,359 INFO L93 Difference]: Finished difference Result 725 states and 1271 transitions. [2022-02-20 18:44:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:55,360 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:44:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:55,361 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:44:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2022-02-20 18:44:55,373 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:44:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2022-02-20 18:44:55,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1271 transitions. [2022-02-20 18:44:56,241 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:44:56,269 INFO L225 Difference]: With dead ends: 725 [2022-02-20 18:44:56,269 INFO L226 Difference]: Without dead ends: 571 [2022-02-20 18:44:56,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:56,274 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:44:56,275 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:44:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-02-20 18:44:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 565. [2022-02-20 18:44:56,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:56,314 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:44:56,316 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:44:56,317 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:44:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:56,335 INFO L93 Difference]: Finished difference Result 571 states and 758 transitions. [2022-02-20 18:44:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2022-02-20 18:44:56,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:56,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:56,339 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:44:56,340 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:44:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:56,360 INFO L93 Difference]: Finished difference Result 571 states and 758 transitions. [2022-02-20 18:44:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2022-02-20 18:44:56,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:56,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:56,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:56,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:56,363 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:44:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 754 transitions. [2022-02-20 18:44:56,383 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 754 transitions. Word has length 51 [2022-02-20 18:44:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:56,383 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 754 transitions. [2022-02-20 18:44:56,384 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:44:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 754 transitions. [2022-02-20 18:44:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:56,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:56,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:56,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:44:56,386 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1349444518, now seen corresponding path program 1 times [2022-02-20 18:44:56,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:56,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928958865] [2022-02-20 18:44:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:56,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:56,461 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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {3146#true} is VALID [2022-02-20 18:44:56,461 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:44:56,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {3146#true} assume 0 == ~r1~0; {3146#true} is VALID [2022-02-20 18:44:56,462 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:44:56,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {3146#true} assume ~id1~0 >= 0; {3146#true} is VALID [2022-02-20 18:44:56,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {3146#true} assume 0 == ~st1~0; {3146#true} is VALID [2022-02-20 18:44:56,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {3146#true} assume ~send1~0 == ~id1~0; {3146#true} is VALID [2022-02-20 18:44:56,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {3146#true} assume 0 == ~mode1~0 % 256; {3146#true} is VALID [2022-02-20 18:44:56,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {3146#true} assume ~id2~0 >= 0; {3146#true} is VALID [2022-02-20 18:44:56,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {3146#true} assume 0 == ~st2~0; {3146#true} is VALID [2022-02-20 18:44:56,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {3146#true} assume ~send2~0 == ~id2~0; {3146#true} is VALID [2022-02-20 18:44:56,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {3146#true} assume 0 == ~mode2~0 % 256; {3146#true} is VALID [2022-02-20 18:44:56,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {3146#true} assume ~id3~0 >= 0; {3146#true} is VALID [2022-02-20 18:44:56,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {3146#true} assume 0 == ~st3~0; {3146#true} is VALID [2022-02-20 18:44:56,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {3146#true} assume ~send3~0 == ~id3~0; {3146#true} is VALID [2022-02-20 18:44:56,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {3146#true} assume 0 == ~mode3~0 % 256; {3146#true} is VALID [2022-02-20 18:44:56,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {3146#true} assume ~id1~0 != ~id2~0; {3146#true} is VALID [2022-02-20 18:44:56,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {3146#true} assume ~id1~0 != ~id3~0; {3146#true} is VALID [2022-02-20 18:44:56,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {3146#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {3146#true} is VALID [2022-02-20 18:44:56,465 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:44:56,465 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:44:56,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {3146#true} assume !!(0 == ~mode1~0 % 256); {3146#true} is VALID [2022-02-20 18:44:56,466 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:44:56,466 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:44:56,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {3146#true} assume !!(0 == ~mode2~0 % 256); {3146#true} is VALID [2022-02-20 18:44:56,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {3146#true} assume !!(0 == ~alive2~0 % 256); {3146#true} is VALID [2022-02-20 18:44:56,466 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:44:56,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {3146#true} assume !!(0 == ~mode3~0 % 256); {3146#true} is VALID [2022-02-20 18:44:56,467 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:44:56,468 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:44:56,468 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:44:56,469 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_7192~0 := main_~check__tmp~40#1;main_~main__c1~0#1 := ~__return_7192~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:44:56,469 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_6409_0~0 := main_~main____CPAchecker_TMP_0~36#1; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:56,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {3148#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:56,470 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:44:56,471 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:44:56,471 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:44:56,471 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:44:56,472 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:44:56,472 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:44:56,473 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:44:56,473 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:44:56,474 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:44:56,474 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:44:56,475 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:44:56,475 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:44:56,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {3147#false} assume !(main_~node3__m3~4#1 > ~id3~0); {3147#false} is VALID [2022-02-20 18:44:56,476 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:44:56,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {3147#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7013~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7013~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:44:56,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {3147#false} assume 0 == main_~assert__arg~7#1 % 256; {3147#false} is VALID [2022-02-20 18:44:56,476 INFO L290 TraceCheckUtils]: 50: Hoare triple {3147#false} assume !false; {3147#false} is VALID [2022-02-20 18:44:56,477 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:56,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:56,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928958865] [2022-02-20 18:44:56,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928958865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:56,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:56,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:56,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042228684] [2022-02-20 18:44:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:56,479 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:44:56,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:56,479 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:44:56,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:56,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:56,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:56,510 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:44:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:57,122 INFO L93 Difference]: Finished difference Result 994 states and 1379 transitions. [2022-02-20 18:44:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:57,122 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:44:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:57,122 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:44:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2022-02-20 18:44:57,128 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:44:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2022-02-20 18:44:57,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 951 transitions. [2022-02-20 18:44:57,721 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:44:57,750 INFO L225 Difference]: With dead ends: 994 [2022-02-20 18:44:57,750 INFO L226 Difference]: Without dead ends: 781 [2022-02-20 18:44:57,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:57,752 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:44:57,753 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:44:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-02-20 18:44:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 774. [2022-02-20 18:44:57,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:57,774 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:44:57,775 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:44:57,776 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:44:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:57,805 INFO L93 Difference]: Finished difference Result 781 states and 1061 transitions. [2022-02-20 18:44:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1061 transitions. [2022-02-20 18:44:57,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:57,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:57,807 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:44:57,809 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:44:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:57,832 INFO L93 Difference]: Finished difference Result 781 states and 1061 transitions. [2022-02-20 18:44:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1061 transitions. [2022-02-20 18:44:57,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:57,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:57,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:57,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:57,835 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:44:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1056 transitions. [2022-02-20 18:44:57,861 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1056 transitions. Word has length 51 [2022-02-20 18:44:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:57,862 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1056 transitions. [2022-02-20 18:44:57,862 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:44:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1056 transitions. [2022-02-20 18:44:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:57,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:57,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:57,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:44:57,864 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:44:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1493728400, now seen corresponding path program 1 times [2022-02-20 18:44:57,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:57,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765532614] [2022-02-20 18:44:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:57,993 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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {6896#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:57,994 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:44:57,994 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:44:57,994 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:44:57,997 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:44:57,997 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:44:57,997 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:44:57,998 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:44:57,998 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:44:57,998 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:44:57,998 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:44:57,999 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:44:58,000 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:44:58,000 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:44:58,001 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:44:58,002 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:44:58,002 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:44:58,009 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:44:58,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {6898#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {6898#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:58,012 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:44:58,012 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:44:58,012 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:44:58,013 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:44:58,013 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:44:58,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {6895#false} assume !!(0 == ~mode2~0 % 256); {6895#false} is VALID [2022-02-20 18:44:58,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {6895#false} assume !!(0 == ~alive2~0 % 256); {6895#false} is VALID [2022-02-20 18:44:58,014 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:44:58,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {6895#false} assume !!(0 == ~mode3~0 % 256); {6895#false} is VALID [2022-02-20 18:44:58,015 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:44:58,015 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:44:58,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {6895#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6895#false} is VALID [2022-02-20 18:44:58,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {6895#false} assume ~r1~0 < 3;main_~check__tmp~38#1 := 1;~__return_7129~0 := main_~check__tmp~38#1;main_~main__c1~0#1 := ~__return_7129~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:44:58,015 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_6409_0~0 := main_~main____CPAchecker_TMP_0~34#1; {6895#false} is VALID [2022-02-20 18:44:58,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {6895#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {6895#false} is VALID [2022-02-20 18:44:58,016 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:44:58,016 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:44:58,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {6895#false} assume main_~node1__m1~1#1 != ~nomsg~0; {6895#false} is VALID [2022-02-20 18:44:58,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {6895#false} assume !(0 == ~alive1~0 % 256); {6895#false} is VALID [2022-02-20 18:44:58,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {6895#false} assume !(main_~node1__m1~1#1 > ~id1~0); {6895#false} is VALID [2022-02-20 18:44:58,016 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:44:58,016 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:44:58,017 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:44:58,017 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:44:58,017 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:44:58,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {6895#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6895#false} is VALID [2022-02-20 18:44:58,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {6895#false} assume !(0 == ~alive3~0 % 256); {6895#false} is VALID [2022-02-20 18:44:58,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {6895#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6895#false} is VALID [2022-02-20 18:44:58,018 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:44:58,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {6895#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7013~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7013~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:44:58,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {6895#false} assume 0 == main_~assert__arg~7#1 % 256; {6895#false} is VALID [2022-02-20 18:44:58,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {6895#false} assume !false; {6895#false} is VALID [2022-02-20 18:44:58,019 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:58,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:58,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765532614] [2022-02-20 18:44:58,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765532614] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:58,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:58,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:58,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868335108] [2022-02-20 18:44:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:58,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:58,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:58,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:58,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:58,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:58,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:58,057 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:44:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:59,419 INFO L93 Difference]: Finished difference Result 1716 states and 2415 transitions. [2022-02-20 18:44:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:59,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:44:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1108 transitions. [2022-02-20 18:44:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1108 transitions. [2022-02-20 18:44:59,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1108 transitions. [2022-02-20 18:45:00,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1108 edges. 1108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:00,195 INFO L225 Difference]: With dead ends: 1716 [2022-02-20 18:45:00,195 INFO L226 Difference]: Without dead ends: 1059 [2022-02-20 18:45:00,196 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:45:00,197 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1737 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:00,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1737 Valid, 391 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:45:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-02-20 18:45:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1053. [2022-02-20 18:45:00,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:00,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1059 states. Second operand has 1053 states, 1049 states have (on average 1.4089609151572926) internal successors, (1478), 1052 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,561 INFO L74 IsIncluded]: Start isIncluded. First operand 1059 states. Second operand has 1053 states, 1049 states have (on average 1.4089609151572926) internal successors, (1478), 1052 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,563 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand has 1053 states, 1049 states have (on average 1.4089609151572926) internal successors, (1478), 1052 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:00,601 INFO L93 Difference]: Finished difference Result 1059 states and 1482 transitions. [2022-02-20 18:45:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1482 transitions. [2022-02-20 18:45:00,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:00,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:00,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 1053 states, 1049 states have (on average 1.4089609151572926) internal successors, (1478), 1052 states have internal predecessors, (1478), 0 states have call successors, (0), 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 1059 states. [2022-02-20 18:45:00,606 INFO L87 Difference]: Start difference. First operand has 1053 states, 1049 states have (on average 1.4089609151572926) internal successors, (1478), 1052 states have internal predecessors, (1478), 0 states have call successors, (0), 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 1059 states. [2022-02-20 18:45:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:00,645 INFO L93 Difference]: Finished difference Result 1059 states and 1482 transitions. [2022-02-20 18:45:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1482 transitions. [2022-02-20 18:45:00,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:00,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:00,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:00,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1049 states have (on average 1.4089609151572926) internal successors, (1478), 1052 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1478 transitions. [2022-02-20 18:45:00,696 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1478 transitions. Word has length 51 [2022-02-20 18:45:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:00,697 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 1478 transitions. [2022-02-20 18:45:00,697 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:45:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1478 transitions. [2022-02-20 18:45:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:45:00,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:00,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:00,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:45:00,699 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:45:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash -358090099, now seen corresponding path program 1 times [2022-02-20 18:45:00,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:00,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059710645] [2022-02-20 18:45:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:00,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {12548#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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {12548#true} is VALID [2022-02-20 18:45:00,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {12548#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; {12548#true} is VALID [2022-02-20 18:45:00,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {12548#true} assume 0 == ~r1~0; {12548#true} is VALID [2022-02-20 18:45:00,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {12548#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {12548#true} is VALID [2022-02-20 18:45:00,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {12548#true} assume ~id1~0 >= 0; {12548#true} is VALID [2022-02-20 18:45:00,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {12548#true} assume 0 == ~st1~0; {12548#true} is VALID [2022-02-20 18:45:00,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {12548#true} assume ~send1~0 == ~id1~0; {12548#true} is VALID [2022-02-20 18:45:00,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {12548#true} assume 0 == ~mode1~0 % 256; {12548#true} is VALID [2022-02-20 18:45:00,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {12548#true} assume ~id2~0 >= 0; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {12548#true} assume 0 == ~st2~0; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {12548#true} assume ~send2~0 == ~id2~0; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {12548#true} assume 0 == ~mode2~0 % 256; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {12548#true} assume ~id3~0 >= 0; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {12548#true} assume 0 == ~st3~0; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {12548#true} assume ~send3~0 == ~id3~0; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {12548#true} assume 0 == ~mode3~0 % 256; {12548#true} is VALID [2022-02-20 18:45:00,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {12548#true} assume ~id1~0 != ~id2~0; {12548#true} is VALID [2022-02-20 18:45:00,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {12548#true} assume ~id1~0 != ~id3~0; {12548#true} is VALID [2022-02-20 18:45:00,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {12548#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {12548#true} is VALID [2022-02-20 18:45:00,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {12548#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; {12548#true} is VALID [2022-02-20 18:45:00,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {12548#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12548#true} is VALID [2022-02-20 18:45:00,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {12548#true} assume !!(0 == ~mode1~0 % 256); {12548#true} is VALID [2022-02-20 18:45:00,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {12548#true} assume !!(0 == ~alive1~0 % 256); {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {12550#(= (+ ~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; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~12#1; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {12550#(= (+ ~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; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 < 3;main_~check__tmp~54#1 := 1;~__return_8533~0 := main_~check__tmp~54#1;main_~main__c1~0#1 := ~__return_8533~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; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {12550#(= (+ ~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_6409_0~0 := main_~main____CPAchecker_TMP_0~50#1; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {12550#(= (+ ~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; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {12550#(= (+ ~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; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {12550#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {12549#false} is VALID [2022-02-20 18:45:00,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {12549#false} assume !(main_~node1__m1~1#1 > ~id1~0); {12549#false} is VALID [2022-02-20 18:45:00,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {12549#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; {12549#false} is VALID [2022-02-20 18:45:00,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {12549#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12549#false} is VALID [2022-02-20 18:45:00,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {12549#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {12549#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {12549#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {12549#false} assume main_~node3__m3~4#1 != ~nomsg~0; {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {12549#false} assume !(0 == ~alive3~0 % 256); {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {12549#false} assume !(main_~node3__m3~4#1 > ~id3~0); {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {12549#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; {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {12549#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7013~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7013~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; {12549#false} is VALID [2022-02-20 18:45:00,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {12549#false} assume 0 == main_~assert__arg~7#1 % 256; {12549#false} is VALID [2022-02-20 18:45:00,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {12549#false} assume !false; {12549#false} is VALID [2022-02-20 18:45:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:00,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:00,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059710645] [2022-02-20 18:45:00,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059710645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:00,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:00,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:00,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503688259] [2022-02-20 18:45:00,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:00,787 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:45:00,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:00,787 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:45:00,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:00,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:00,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:00,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:00,816 INFO L87 Difference]: Start difference. First operand 1053 states and 1478 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:45:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:01,981 INFO L93 Difference]: Finished difference Result 2099 states and 2965 transitions. [2022-02-20 18:45:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:01,982 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:45:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:01,982 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:45:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-02-20 18:45:01,986 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:45:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-02-20 18:45:01,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 959 transitions. [2022-02-20 18:45:02,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 959 edges. 959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:02,608 INFO L225 Difference]: With dead ends: 2099 [2022-02-20 18:45:02,609 INFO L226 Difference]: Without dead ends: 1399 [2022-02-20 18:45:02,612 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:45:02,616 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 364 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 929 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:45:02,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 929 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-02-20 18:45:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1385. [2022-02-20 18:45:03,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:03,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1399 states. Second operand has 1385 states, 1381 states have (on average 1.3721940622737148) internal successors, (1895), 1384 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,109 INFO L74 IsIncluded]: Start isIncluded. First operand 1399 states. Second operand has 1385 states, 1381 states have (on average 1.3721940622737148) internal successors, (1895), 1384 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,111 INFO L87 Difference]: Start difference. First operand 1399 states. Second operand has 1385 states, 1381 states have (on average 1.3721940622737148) internal successors, (1895), 1384 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:03,173 INFO L93 Difference]: Finished difference Result 1399 states and 1907 transitions. [2022-02-20 18:45:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1907 transitions. [2022-02-20 18:45:03,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:03,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:03,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 1385 states, 1381 states have (on average 1.3721940622737148) internal successors, (1895), 1384 states have internal predecessors, (1895), 0 states have call successors, (0), 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 1399 states. [2022-02-20 18:45:03,179 INFO L87 Difference]: Start difference. First operand has 1385 states, 1381 states have (on average 1.3721940622737148) internal successors, (1895), 1384 states have internal predecessors, (1895), 0 states have call successors, (0), 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 1399 states. [2022-02-20 18:45:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:03,242 INFO L93 Difference]: Finished difference Result 1399 states and 1907 transitions. [2022-02-20 18:45:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1907 transitions. [2022-02-20 18:45:03,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:03,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:03,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:03,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1381 states have (on average 1.3721940622737148) internal successors, (1895), 1384 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1895 transitions. [2022-02-20 18:45:03,319 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1895 transitions. Word has length 52 [2022-02-20 18:45:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:03,320 INFO L470 AbstractCegarLoop]: Abstraction has 1385 states and 1895 transitions. [2022-02-20 18:45:03,320 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:45:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1895 transitions. [2022-02-20 18:45:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:45:03,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:03,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:03,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:45:03,323 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:45:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1296606516, now seen corresponding path program 1 times [2022-02-20 18:45:03,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:03,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430461563] [2022-02-20 18:45:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:03,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {19862#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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {19864#(<= (+ ~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; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {19864#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {19864#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {19864#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {19864#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {19864#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {19864#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {19864#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:03,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {19864#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {19865#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:03,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {19865#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {19865#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:03,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {19865#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {19866#(<= (+ ~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; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {19866#(<= (+ ~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; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {19866#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {19866#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:03,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {19866#(<= (+ ~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; {19863#false} is VALID [2022-02-20 18:45:03,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {19863#false} assume !!(0 == ~mode3~0 % 256); {19863#false} is VALID [2022-02-20 18:45:03,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {19863#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~10#1; {19863#false} is VALID [2022-02-20 18:45:03,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {19863#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; {19863#false} is VALID [2022-02-20 18:45:03,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {19863#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19863#false} is VALID [2022-02-20 18:45:03,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {19863#false} assume ~r1~0 < 3;main_~check__tmp~46#1 := 1;~__return_8240~0 := main_~check__tmp~46#1;main_~main__c1~0#1 := ~__return_8240~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; {19863#false} is VALID [2022-02-20 18:45:03,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {19863#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_6409_0~0 := main_~main____CPAchecker_TMP_0~42#1; {19863#false} is VALID [2022-02-20 18:45:03,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {19863#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {19863#false} is VALID [2022-02-20 18:45:03,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {19863#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19863#false} is VALID [2022-02-20 18:45:03,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {19863#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; {19863#false} is VALID [2022-02-20 18:45:03,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {19863#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {19863#false} is VALID [2022-02-20 18:45:03,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {19863#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {19863#false} is VALID [2022-02-20 18:45:03,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {19863#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19863#false} is VALID [2022-02-20 18:45:03,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {19863#false} assume main_~node2__m2~1#1 != ~nomsg~0; {19863#false} is VALID [2022-02-20 18:45:03,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {19863#false} assume !(0 == ~alive2~0 % 256); {19863#false} is VALID [2022-02-20 18:45:03,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {19863#false} assume !(main_~node2__m2~1#1 > ~id2~0); {19863#false} is VALID [2022-02-20 18:45:03,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {19863#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; {19863#false} is VALID [2022-02-20 18:45:03,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {19863#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19863#false} is VALID [2022-02-20 18:45:03,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {19863#false} assume main_~node3__m3~3#1 != ~nomsg~0; {19863#false} is VALID [2022-02-20 18:45:03,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {19863#false} assume !(0 == ~alive3~0 % 256); {19863#false} is VALID [2022-02-20 18:45:03,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {19863#false} assume !(main_~node3__m3~3#1 > ~id3~0); {19863#false} is VALID [2022-02-20 18:45:03,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {19863#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; {19863#false} is VALID [2022-02-20 18:45:03,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {19863#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7743~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7743~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; {19863#false} is VALID [2022-02-20 18:45:03,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {19863#false} assume 0 == main_~assert__arg~5#1 % 256; {19863#false} is VALID [2022-02-20 18:45:03,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {19863#false} assume !false; {19863#false} is VALID [2022-02-20 18:45:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:03,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:03,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430461563] [2022-02-20 18:45:03,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430461563] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:03,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:03,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:03,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541301253] [2022-02-20 18:45:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:03,421 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:45:03,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:03,421 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:45:03,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:03,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:03,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:03,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:03,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:03,451 INFO L87 Difference]: Start difference. First operand 1385 states and 1895 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:45:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:05,665 INFO L93 Difference]: Finished difference Result 2980 states and 4125 transitions. [2022-02-20 18:45:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:05,665 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:45:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:05,666 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:45:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 911 transitions. [2022-02-20 18:45:05,670 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:45:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 911 transitions. [2022-02-20 18:45:05,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 911 transitions. [2022-02-20 18:45:06,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 911 edges. 911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:06,413 INFO L225 Difference]: With dead ends: 2980 [2022-02-20 18:45:06,413 INFO L226 Difference]: Without dead ends: 1767 [2022-02-20 18:45:06,414 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:45:06,415 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 1521 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:06,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 367 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:45:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2022-02-20 18:45:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1755. [2022-02-20 18:45:07,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:07,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1767 states. Second operand has 1755 states, 1751 states have (on average 1.3774985722444317) internal successors, (2412), 1754 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,503 INFO L74 IsIncluded]: Start isIncluded. First operand 1767 states. Second operand has 1755 states, 1751 states have (on average 1.3774985722444317) internal successors, (2412), 1754 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,505 INFO L87 Difference]: Start difference. First operand 1767 states. Second operand has 1755 states, 1751 states have (on average 1.3774985722444317) internal successors, (2412), 1754 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,598 INFO L93 Difference]: Finished difference Result 1767 states and 2422 transitions. [2022-02-20 18:45:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2422 transitions. [2022-02-20 18:45:07,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:07,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:07,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 1755 states, 1751 states have (on average 1.3774985722444317) internal successors, (2412), 1754 states have internal predecessors, (2412), 0 states have call successors, (0), 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 1767 states. [2022-02-20 18:45:07,610 INFO L87 Difference]: Start difference. First operand has 1755 states, 1751 states have (on average 1.3774985722444317) internal successors, (2412), 1754 states have internal predecessors, (2412), 0 states have call successors, (0), 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 1767 states. [2022-02-20 18:45:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,710 INFO L93 Difference]: Finished difference Result 1767 states and 2422 transitions. [2022-02-20 18:45:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2422 transitions. [2022-02-20 18:45:07,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:07,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:07,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:07,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1751 states have (on average 1.3774985722444317) internal successors, (2412), 1754 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2412 transitions. [2022-02-20 18:45:07,842 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2412 transitions. Word has length 52 [2022-02-20 18:45:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:07,842 INFO L470 AbstractCegarLoop]: Abstraction has 1755 states and 2412 transitions. [2022-02-20 18:45:07,842 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:45:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2412 transitions. [2022-02-20 18:45:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:45:07,844 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:07,844 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:45:07,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:45:07,844 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:45:07,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash -482685133, now seen corresponding path program 1 times [2022-02-20 18:45:07,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:07,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129403672] [2022-02-20 18:45:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:07,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {29622#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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {29624#(<= (+ ~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; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {29624#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:07,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {29624#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {29625#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:07,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {29625#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {29625#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:07,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {29625#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {29626#(<= (+ ~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; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {29626#(<= (+ ~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; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {29626#(<= (+ ~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); {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {29626#(<= (+ ~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; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {29626#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {29626#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {29626#(<= (+ ~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; {29623#false} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {29623#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {29623#false} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {29623#false} assume ~r1~0 < 3;main_~check__tmp~22#1 := 1;~__return_7927~0 := main_~check__tmp~22#1;main_~main__c1~0#1 := ~__return_7927~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; {29623#false} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {29623#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_6409_0~0 := main_~main____CPAchecker_TMP_0~18#1; {29623#false} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {29623#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {29623#false} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {29623#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {29623#false} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {29623#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; {29623#false} is VALID [2022-02-20 18:45:07,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {29623#false} assume main_~node1__m1~1#1 != ~nomsg~0; {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {29623#false} assume !(0 == ~alive1~0 % 256); {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {29623#false} assume !(main_~node1__m1~1#1 > ~id1~0); {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {29623#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; {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {29623#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {29623#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {29623#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {29623#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {29623#false} assume main_~node3__m3~4#1 != ~nomsg~0; {29623#false} is VALID [2022-02-20 18:45:07,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {29623#false} assume !(0 == ~alive3~0 % 256); {29623#false} is VALID [2022-02-20 18:45:07,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {29623#false} assume !(main_~node3__m3~4#1 > ~id3~0); {29623#false} is VALID [2022-02-20 18:45:07,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {29623#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; {29623#false} is VALID [2022-02-20 18:45:07,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {29623#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7013~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7013~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; {29623#false} is VALID [2022-02-20 18:45:07,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {29623#false} assume 0 == main_~assert__arg~7#1 % 256; {29623#false} is VALID [2022-02-20 18:45:07,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {29623#false} assume !false; {29623#false} is VALID [2022-02-20 18:45:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:07,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:07,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129403672] [2022-02-20 18:45:07,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129403672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:07,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:07,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:07,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182695268] [2022-02-20 18:45:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:07,907 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:45:07,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:07,908 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:45:07,936 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:45:07,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:07,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:07,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:07,937 INFO L87 Difference]: Start difference. First operand 1755 states and 2412 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:45:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:11,234 INFO L93 Difference]: Finished difference Result 3900 states and 5393 transitions. [2022-02-20 18:45:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:11,234 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:45:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:11,235 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:45:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 810 transitions. [2022-02-20 18:45:11,238 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:45:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 810 transitions. [2022-02-20 18:45:11,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 810 transitions. [2022-02-20 18:45:11,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 810 edges. 810 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:11,936 INFO L225 Difference]: With dead ends: 3900 [2022-02-20 18:45:11,936 INFO L226 Difference]: Without dead ends: 2317 [2022-02-20 18:45:11,938 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:45:11,938 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1366 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:11,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 335 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2022-02-20 18:45:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2301. [2022-02-20 18:45:13,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:13,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2317 states. Second operand has 2301 states, 2297 states have (on average 1.370047888550283) internal successors, (3147), 2300 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:13,990 INFO L74 IsIncluded]: Start isIncluded. First operand 2317 states. Second operand has 2301 states, 2297 states have (on average 1.370047888550283) internal successors, (3147), 2300 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:13,992 INFO L87 Difference]: Start difference. First operand 2317 states. Second operand has 2301 states, 2297 states have (on average 1.370047888550283) internal successors, (3147), 2300 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:14,152 INFO L93 Difference]: Finished difference Result 2317 states and 3161 transitions. [2022-02-20 18:45:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3161 transitions. [2022-02-20 18:45:14,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:14,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:14,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 2301 states, 2297 states have (on average 1.370047888550283) internal successors, (3147), 2300 states have internal predecessors, (3147), 0 states have call successors, (0), 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 2317 states. [2022-02-20 18:45:14,159 INFO L87 Difference]: Start difference. First operand has 2301 states, 2297 states have (on average 1.370047888550283) internal successors, (3147), 2300 states have internal predecessors, (3147), 0 states have call successors, (0), 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 2317 states. [2022-02-20 18:45:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:14,318 INFO L93 Difference]: Finished difference Result 2317 states and 3161 transitions. [2022-02-20 18:45:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3161 transitions. [2022-02-20 18:45:14,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:14,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:14,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:14,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2297 states have (on average 1.370047888550283) internal successors, (3147), 2300 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3147 transitions. [2022-02-20 18:45:14,556 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3147 transitions. Word has length 53 [2022-02-20 18:45:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:14,556 INFO L470 AbstractCegarLoop]: Abstraction has 2301 states and 3147 transitions. [2022-02-20 18:45:14,556 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:45:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3147 transitions. [2022-02-20 18:45:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:45:14,558 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:14,559 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:45:14,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:45:14,559 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:45:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1630046103, now seen corresponding path program 1 times [2022-02-20 18:45:14,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:14,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264874258] [2022-02-20 18:45:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:14,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {42575#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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {42577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {42577#(<= (+ ~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; {42577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {42577#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {42577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {42577#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {42577#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:14,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {42577#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode1~0 % 256; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 >= 0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st2~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send2~0 == ~id2~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode2~0 % 256; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id3~0 >= 0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st3~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send3~0 == ~id3~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode3~0 % 256; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id2~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id3~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {42578#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {42578#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {42578#(<= (+ ~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; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {42579#(<= (+ ~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; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode1~0 % 256); {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send1~0 != ~nomsg~0; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {42579#(<= (+ ~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); {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode2~0 % 256); {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send2~0 != ~nomsg~0; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {42579#(<= (+ ~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; {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode3~0 % 256); {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {42579#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~alive3~0 % 256); {42579#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {42579#(<= (+ ~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; {42580#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {42580#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {42580#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {42580#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~r1~0 < 3;main_~check__tmp~12#1 := 1;~__return_7844~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_7844~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; {42580#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {42580#(<= (+ ~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_6409_0~0 := main_~main____CPAchecker_TMP_0~8#1; {42580#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {42580#(<= (+ ~p3_old~0 1) ~id1~0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {42580#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {42580#(<= (+ ~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; {42580#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:45:14,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {42580#(<= (+ ~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; {42581#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:45:14,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {42581#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {42581#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:45:14,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {42581#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(0 == ~alive1~0 % 256); {42581#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:45:14,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {42581#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {42581#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:45:14,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {42581#(<= (+ |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; {42576#false} is VALID [2022-02-20 18:45:14,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {42576#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {42576#false} is VALID [2022-02-20 18:45:14,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {42576#false} assume main_~node2__m2~3#1 != ~nomsg~0; {42576#false} is VALID [2022-02-20 18:45:14,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {42576#false} assume !(0 == ~alive2~0 % 256); {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {42576#false} assume !(main_~node2__m2~3#1 > ~id2~0); {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {42576#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; {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {42576#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {42576#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {42576#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; {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {42576#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_7586~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_7586~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; {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {42576#false} assume 0 == main_~assert__arg~8#1 % 256; {42576#false} is VALID [2022-02-20 18:45:14,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {42576#false} assume !false; {42576#false} is VALID [2022-02-20 18:45:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:14,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:14,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264874258] [2022-02-20 18:45:14,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264874258] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:14,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:14,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:45:14,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748526142] [2022-02-20 18:45:14,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:14,661 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:45:14,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:14,661 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:45:14,698 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:45:14,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:45:14,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:45:14,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:45:14,699 INFO L87 Difference]: Start difference. First operand 2301 states and 3147 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:45:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:26,902 INFO L93 Difference]: Finished difference Result 7377 states and 10306 transitions. [2022-02-20 18:45:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:45:26,903 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:45:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:26,903 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:45:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 934 transitions. [2022-02-20 18:45:26,906 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:45:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 934 transitions. [2022-02-20 18:45:26,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 934 transitions. [2022-02-20 18:45:27,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 934 edges. 934 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:29,220 INFO L225 Difference]: With dead ends: 7377 [2022-02-20 18:45:29,220 INFO L226 Difference]: Without dead ends: 6335 [2022-02-20 18:45:29,233 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:45:29,234 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 2702 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:29,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2702 Valid, 599 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:45:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6335 states. [2022-02-20 18:45:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6335 to 2315. [2022-02-20 18:45:32,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:32,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6335 states. Second operand has 2315 states, 2311 states have (on average 1.3695369969710083) internal successors, (3165), 2314 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:32,192 INFO L74 IsIncluded]: Start isIncluded. First operand 6335 states. Second operand has 2315 states, 2311 states have (on average 1.3695369969710083) internal successors, (3165), 2314 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:32,193 INFO L87 Difference]: Start difference. First operand 6335 states. Second operand has 2315 states, 2311 states have (on average 1.3695369969710083) internal successors, (3165), 2314 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:33,463 INFO L93 Difference]: Finished difference Result 6335 states and 8845 transitions. [2022-02-20 18:45:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 8845 transitions. [2022-02-20 18:45:33,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:33,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:33,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 2315 states, 2311 states have (on average 1.3695369969710083) internal successors, (3165), 2314 states have internal predecessors, (3165), 0 states have call successors, (0), 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 6335 states. [2022-02-20 18:45:33,473 INFO L87 Difference]: Start difference. First operand has 2315 states, 2311 states have (on average 1.3695369969710083) internal successors, (3165), 2314 states have internal predecessors, (3165), 0 states have call successors, (0), 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 6335 states. [2022-02-20 18:45:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:34,817 INFO L93 Difference]: Finished difference Result 6335 states and 8845 transitions. [2022-02-20 18:45:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 8845 transitions. [2022-02-20 18:45:34,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:34,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:34,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:34,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2311 states have (on average 1.3695369969710083) internal successors, (3165), 2314 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3165 transitions. [2022-02-20 18:45:35,047 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3165 transitions. Word has length 54 [2022-02-20 18:45:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:35,047 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 3165 transitions. [2022-02-20 18:45:35,048 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:45:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3165 transitions. [2022-02-20 18:45:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:45:35,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:35,049 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:45:35,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:45:35,049 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:45:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1470909546, now seen corresponding path program 1 times [2022-02-20 18:45:35,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:35,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016995414] [2022-02-20 18:45:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:35,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {68677#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(63, 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_6321~0 := 0;~__return_7777~0 := 0;~__tmp_6409_0~0 := 0;~__return_6462~0 := 0;~__tmp_6472_0~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6936~0 := 0;~__return_7497~0 := 0;~__return_7743~0 := 0;~__return_6755~0 := 0;~__return_7013~0 := 0;~__return_7586~0 := 0;~__return_7817~0 := 0;~__return_7703~0 := 0;~__return_7878~0 := 0;~__return_7844~0 := 0;~__return_7534~0 := 0;~__return_7443~0 := 0;~__return_7653~0 := 0;~__return_7619~0 := 0;~__return_8108~0 := 0;~__return_8076~0 := 0;~__return_8173~0 := 0;~__return_8139~0 := 0;~__return_7959~0 := 0;~__return_7927~0 := 0;~__return_8024~0 := 0;~__return_7990~0 := 0;~__return_6973~0 := 0;~__return_6894~0 := 0;~__return_7080~0 := 0;~__return_7046~0 := 0;~__return_6689~0 := 0;~__return_6399~0 := 0;~__return_6844~0 := 0;~__return_6810~0 := 0;~__return_7310~0 := 0;~__return_7278~0 := 0;~__return_7375~0 := 0;~__return_7341~0 := 0;~__return_7161~0 := 0;~__return_7129~0 := 0;~__return_7226~0 := 0;~__return_7192~0 := 0;~__return_8419~0 := 0;~__return_8387~0 := 0;~__return_8484~0 := 0;~__return_8450~0 := 0;~__return_8272~0 := 0;~__return_8240~0 := 0;~__return_8337~0 := 0;~__return_8303~0 := 0;~__return_8714~0 := 0;~__return_8682~0 := 0;~__return_8779~0 := 0;~__return_8745~0 := 0;~__return_8565~0 := 0;~__return_8533~0 := 0;~__return_8630~0 := 0;~__return_8596~0 := 0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {68679#(<= (+ ~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; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {68679#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:35,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {68679#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {68680#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {68680#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {68680#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {68680#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {68680#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {68680#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~mode3~0 % 256; {68680#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {68680#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id2~0; {68680#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {68680#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id3~0; {68680#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {68680#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {68680#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {68680#(<= (+ ~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; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {68681#(<= (+ ~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; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode1~0 % 256); {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send1~0 != ~nomsg~0; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {68681#(<= (+ ~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); {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode2~0 % 256); {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~alive2~0 % 256); {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {68681#(<= (+ ~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; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode3~0 % 256); {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {68681#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send3~0 != ~nomsg~0; {68681#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {68681#(<= (+ ~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; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~r1~0 < 3;main_~check__tmp~21#1 := 1;~__return_7959~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_7959~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; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {68682#(<= (+ ~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_6409_0~0 := main_~main____CPAchecker_TMP_0~17#1; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6409_0~0; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {68682#(<= (+ ~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; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {68682#(<= (+ ~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; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256); {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {68682#(<= (+ ~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; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {68682#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:45:35,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {68682#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {68683#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:35,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {68683#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {68683#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:35,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {68683#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(0 == ~alive3~0 % 256); {68683#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:35,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {68683#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(main_~node3__m3~4#1 > ~id3~0); {68683#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:45:35,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {68683#(<= (+ |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; {68678#false} is VALID [2022-02-20 18:45:35,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {68678#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7013~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7013~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; {68678#false} is VALID [2022-02-20 18:45:35,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {68678#false} assume 0 == main_~assert__arg~7#1 % 256; {68678#false} is VALID [2022-02-20 18:45:35,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {68678#false} assume !false; {68678#false} is VALID [2022-02-20 18:45:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:35,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:35,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016995414] [2022-02-20 18:45:35,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016995414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:35,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:35,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:45:35,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329923823] [2022-02-20 18:45:35,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:35,140 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:45:35,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:35,140 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:45:35,170 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:45:35,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:45:35,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:45:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:45:35,171 INFO L87 Difference]: Start difference. First operand 2315 states and 3165 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:45:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:52,698 INFO L93 Difference]: Finished difference Result 8133 states and 11423 transitions. [2022-02-20 18:45:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:45:52,698 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:45:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:52,698 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:45:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 959 transitions. [2022-02-20 18:45:52,701 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:45:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 959 transitions. [2022-02-20 18:45:52,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 959 transitions.