./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-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.4.ufo.BOUNDED-8.pals.c.v+nlh-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 5aad5fd4611705ad6fdf71db638f2162c13b3da201193a54a746a0dc7cc3072f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:47:00,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:47:00,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:47:00,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:47:00,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:47:00,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:47:00,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:47:00,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:47:00,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:47:00,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:47:00,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:47:00,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:47:00,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:47:00,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:47:00,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:47:00,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:47:00,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:47:00,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:47:00,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:47:00,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:47:00,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:47:00,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:47:00,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:47:01,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:47:01,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:47:01,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:47:01,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:47:01,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:47:01,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:47:01,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:47:01,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:47:01,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:47:01,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:47:01,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:47:01,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:47:01,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:47:01,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:47:01,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:47:01,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:47:01,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:47:01,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:47:01,012 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:47:01,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:47:01,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:47:01,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:47:01,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:47:01,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:47:01,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:47:01,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:47:01,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:47:01,059 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:47:01,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:47:01,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:47:01,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:47:01,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:47:01,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:47:01,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:47:01,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:47:01,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:47:01,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:47:01,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:47:01,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:47:01,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:47:01,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:47:01,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:47:01,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:47:01,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:47:01,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:47:01,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:47:01,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:47:01,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:47:01,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:47:01,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:47:01,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:47:01,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:47:01,064 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 -> 5aad5fd4611705ad6fdf71db638f2162c13b3da201193a54a746a0dc7cc3072f [2022-02-20 18:47:01,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:47:01,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:47:01,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:47:01,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:47:01,305 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:47:01,306 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.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:47:01,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccb64cd7/340c0acd28a346e2b0efd6bde16814fd/FLAG568bdeb8c [2022-02-20 18:47:01,747 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:47:01,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:47:01,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccb64cd7/340c0acd28a346e2b0efd6bde16814fd/FLAG568bdeb8c [2022-02-20 18:47:02,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccb64cd7/340c0acd28a346e2b0efd6bde16814fd [2022-02-20 18:47:02,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:47:02,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:47:02,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:47:02,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:47:02,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:47:02,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154b9354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02, skipping insertion in model container [2022-02-20 18:47:02,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:47:02,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:47:02,339 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.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7251,7264] [2022-02-20 18:47:02,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:47:02,409 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:47:02,447 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.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7251,7264] [2022-02-20 18:47:02,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:47:02,496 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:47:02,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02 WrapperNode [2022-02-20 18:47:02,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:47:02,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:47:02,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:47:02,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:47:02,510 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:47:02" (1/1) ... [2022-02-20 18:47:02,531 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:47:02" (1/1) ... [2022-02-20 18:47:02,572 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 673 [2022-02-20 18:47:02,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:47:02,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:47:02,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:47:02,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:47:02,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:47:02,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:47:02,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:47:02,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:47:02,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (1/1) ... [2022-02-20 18:47:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:47:02,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:47:02,640 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:47:02,646 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:47:02,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:47:02,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:47:02,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:47:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:47:02,796 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:47:02,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:47:03,390 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:47:03,396 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:47:03,396 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:47:03,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:47:03 BoogieIcfgContainer [2022-02-20 18:47:03,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:47:03,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:47:03,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:47:03,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:47:03,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:47:02" (1/3) ... [2022-02-20 18:47:03,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a558b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:47:03, skipping insertion in model container [2022-02-20 18:47:03,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:02" (2/3) ... [2022-02-20 18:47:03,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a558b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:47:03, skipping insertion in model container [2022-02-20 18:47:03,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:47:03" (3/3) ... [2022-02-20 18:47:03,404 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:47:03,407 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:47:03,408 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:47:03,437 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:47:03,441 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:47:03,442 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:47:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:47:03,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:03,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:03,479 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:03,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1338980314, now seen corresponding path program 1 times [2022-02-20 18:47:03,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:03,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880187553] [2022-02-20 18:47:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:03,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19388~0 := 0;~__tmp_19535_0~0 := 0;~__return_19551~0 := 0;~__return_19565~0 := 0; {183#true} is VALID [2022-02-20 18:47:03,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#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_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#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_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {183#true} is VALID [2022-02-20 18:47:03,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume 0 == ~r1~0; {183#true} is VALID [2022-02-20 18:47:03,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {183#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {183#true} is VALID [2022-02-20 18:47:03,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {183#true} assume ~id1~0 >= 0; {183#true} is VALID [2022-02-20 18:47:03,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} assume 0 == ~st1~0; {185#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:03,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {185#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:03,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {185#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:03,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#(<= ~st1~0 0)} assume ~id2~0 >= 0; {185#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:03,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#(<= ~st1~0 0)} assume 0 == ~st2~0; {186#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {186#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {186#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {186#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {186#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {187#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_19388~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19388~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,875 INFO L290 TraceCheckUtils]: 46: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,884 INFO L290 TraceCheckUtils]: 55: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;~__tmp_19535_0~0 := main_~main____CPAchecker_TMP_0~0#1; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_19535_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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:03,888 INFO L290 TraceCheckUtils]: 61: Hoare triple {188#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {184#false} is VALID [2022-02-20 18:47:03,888 INFO L290 TraceCheckUtils]: 62: Hoare triple {184#false} ~__return_19551~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19551~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {184#false} is VALID [2022-02-20 18:47:03,888 INFO L290 TraceCheckUtils]: 63: Hoare triple {184#false} assume 0 == main_~assert__arg~1#1 % 256; {184#false} is VALID [2022-02-20 18:47:03,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-02-20 18:47:03,891 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:47:03,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:03,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880187553] [2022-02-20 18:47:03,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880187553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:03,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:03,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:47:03,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54005609] [2022-02-20 18:47:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:03,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:47:03,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:03,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:03,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:03,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:47:03,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:03,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:47:03,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:03,992 INFO L87 Difference]: Start difference. First operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:05,340 INFO L93 Difference]: Finished difference Result 640 states and 1036 transitions. [2022-02-20 18:47:05,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:47:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1036 transitions. [2022-02-20 18:47:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1036 transitions. [2022-02-20 18:47:05,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1036 transitions. [2022-02-20 18:47:06,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1036 edges. 1036 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:06,133 INFO L225 Difference]: With dead ends: 640 [2022-02-20 18:47:06,134 INFO L226 Difference]: Without dead ends: 541 [2022-02-20 18:47:06,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:47:06,139 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 1605 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:06,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1605 Valid, 1129 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-02-20 18:47:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 275. [2022-02-20 18:47:06,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:06,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,255 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,256 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:06,271 INFO L93 Difference]: Finished difference Result 541 states and 830 transitions. [2022-02-20 18:47:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 830 transitions. [2022-02-20 18:47:06,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:06,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:06,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 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 541 states. [2022-02-20 18:47:06,275 INFO L87 Difference]: Start difference. First operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 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 541 states. [2022-02-20 18:47:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:06,292 INFO L93 Difference]: Finished difference Result 541 states and 830 transitions. [2022-02-20 18:47:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 830 transitions. [2022-02-20 18:47:06,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:06,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:06,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:06,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 412 transitions. [2022-02-20 18:47:06,301 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 412 transitions. Word has length 65 [2022-02-20 18:47:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:06,302 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 412 transitions. [2022-02-20 18:47:06,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 412 transitions. [2022-02-20 18:47:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:47:06,303 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:06,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:06,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:47:06,304 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1162317624, now seen corresponding path program 1 times [2022-02-20 18:47:06,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:06,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256297321] [2022-02-20 18:47:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:06,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {2487#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19388~0 := 0;~__tmp_19535_0~0 := 0;~__return_19551~0 := 0;~__return_19565~0 := 0; {2487#true} is VALID [2022-02-20 18:47:06,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2487#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_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#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_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {2487#true} is VALID [2022-02-20 18:47:06,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {2487#true} assume 0 == ~r1~0; {2487#true} is VALID [2022-02-20 18:47:06,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {2487#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:06,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {2489#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:06,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:06,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:06,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:06,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {2490#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:06,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:06,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:06,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:06,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {2491#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:06,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:06,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:06,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~mode4~0 % 256); {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:06,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {2492#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~alive4~0 % 256); {2488#false} is VALID [2022-02-20 18:47:06,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {2488#false} assume !(~send4~0 != ~id4~0); {2488#false} is VALID [2022-02-20 18:47:06,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {2488#false} ~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2488#false} is VALID [2022-02-20 18:47:06,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {2488#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2488#false} is VALID [2022-02-20 18:47:06,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {2488#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_19388~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19388~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2488#false} is VALID [2022-02-20 18:47:06,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {2488#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2488#false} is VALID [2022-02-20 18:47:06,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {2488#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {2488#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {2488#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2488#false} is VALID [2022-02-20 18:47:06,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {2488#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {2488#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {2488#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2488#false} is VALID [2022-02-20 18:47:06,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {2488#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,479 INFO L290 TraceCheckUtils]: 54: Hoare triple {2488#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,479 INFO L290 TraceCheckUtils]: 55: Hoare triple {2488#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2488#false} is VALID [2022-02-20 18:47:06,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {2488#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {2488#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2488#false} is VALID [2022-02-20 18:47:06,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {2488#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {2488#false} is VALID [2022-02-20 18:47:06,479 INFO L290 TraceCheckUtils]: 59: Hoare triple {2488#false} ~mode4~0 := 0;~__tmp_19535_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2488#false} is VALID [2022-02-20 18:47:06,480 INFO L290 TraceCheckUtils]: 60: Hoare triple {2488#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_19535_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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {2488#false} is VALID [2022-02-20 18:47:06,480 INFO L290 TraceCheckUtils]: 61: Hoare triple {2488#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2488#false} is VALID [2022-02-20 18:47:06,480 INFO L290 TraceCheckUtils]: 62: Hoare triple {2488#false} assume ~r1~0 < 4;main_~check__tmp~1#1 := 1; {2488#false} is VALID [2022-02-20 18:47:06,480 INFO L290 TraceCheckUtils]: 63: Hoare triple {2488#false} ~__return_19551~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19551~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {2488#false} is VALID [2022-02-20 18:47:06,480 INFO L290 TraceCheckUtils]: 64: Hoare triple {2488#false} assume 0 == main_~assert__arg~1#1 % 256; {2488#false} is VALID [2022-02-20 18:47:06,480 INFO L290 TraceCheckUtils]: 65: Hoare triple {2488#false} assume !false; {2488#false} is VALID [2022-02-20 18:47:06,481 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:47:06,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:06,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256297321] [2022-02-20 18:47:06,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256297321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:06,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:06,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:47:06,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538614587] [2022-02-20 18:47:06,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:06,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:47:06,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:06,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:06,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:06,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:47:06,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:06,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:47:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:06,542 INFO L87 Difference]: Start difference. First operand 275 states and 412 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:07,933 INFO L93 Difference]: Finished difference Result 1013 states and 1556 transitions. [2022-02-20 18:47:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:47:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions. [2022-02-20 18:47:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions. [2022-02-20 18:47:07,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 892 transitions. [2022-02-20 18:47:08,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 892 edges. 892 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:08,665 INFO L225 Difference]: With dead ends: 1013 [2022-02-20 18:47:08,665 INFO L226 Difference]: Without dead ends: 801 [2022-02-20 18:47:08,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:08,667 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 778 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:08,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 895 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-02-20 18:47:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 795. [2022-02-20 18:47:09,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:09,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 801 states. Second operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:09,076 INFO L74 IsIncluded]: Start isIncluded. First operand 801 states. Second operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:09,077 INFO L87 Difference]: Start difference. First operand 801 states. Second operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:09,107 INFO L93 Difference]: Finished difference Result 801 states and 1214 transitions. [2022-02-20 18:47:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1214 transitions. [2022-02-20 18:47:09,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:09,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:09,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 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 801 states. [2022-02-20 18:47:09,113 INFO L87 Difference]: Start difference. First operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 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 801 states. [2022-02-20 18:47:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:09,142 INFO L93 Difference]: Finished difference Result 801 states and 1214 transitions. [2022-02-20 18:47:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1214 transitions. [2022-02-20 18:47:09,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:09,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:09,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:09,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1211 transitions. [2022-02-20 18:47:09,176 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1211 transitions. Word has length 66 [2022-02-20 18:47:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:09,176 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1211 transitions. [2022-02-20 18:47:09,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1211 transitions. [2022-02-20 18:47:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:47:09,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:09,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:09,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:47:09,178 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:09,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -314049844, now seen corresponding path program 1 times [2022-02-20 18:47:09,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:09,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529108188] [2022-02-20 18:47:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:09,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {6491#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19388~0 := 0;~__tmp_19535_0~0 := 0;~__return_19551~0 := 0;~__return_19565~0 := 0; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {6493#(<= (+ ~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_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#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_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {6493#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {6493#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {6493#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {6493#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {6493#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {6493#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {6493#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:09,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {6493#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {6494#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:47:09,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {6494#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {6494#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:47:09,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {6494#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {6495#(<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6495#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:09,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {6495#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6492#false} is VALID [2022-02-20 18:47:09,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {6492#false} ~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); {6492#false} is VALID [2022-02-20 18:47:09,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {6492#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {6492#false} assume !!(0 == ~mode3~0 % 256); {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {6492#false} assume !!(0 == ~alive3~0 % 256); {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {6492#false} assume !(~send3~0 != ~id3~0); {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {6492#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {6492#false} assume !!(0 == ~mode4~0 % 256); {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {6492#false} assume !!(0 == ~alive4~0 % 256); {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {6492#false} assume !(~send4~0 != ~id4~0); {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {6492#false} ~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {6492#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {6492#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_19388~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19388~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6492#false} is VALID [2022-02-20 18:47:09,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {6492#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {6492#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {6492#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {6492#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {6492#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {6492#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {6492#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {6492#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 55: Hoare triple {6492#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {6492#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {6492#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {6492#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {6492#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {6492#false} ~mode4~0 := 0;~__tmp_19535_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {6492#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_19535_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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {6492#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {6492#false} assume ~r1~0 < 4;main_~check__tmp~1#1 := 1; {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {6492#false} ~__return_19551~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19551~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {6492#false} assume 0 == main_~assert__arg~1#1 % 256; {6492#false} is VALID [2022-02-20 18:47:09,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {6492#false} assume !false; {6492#false} is VALID [2022-02-20 18:47:09,288 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:47:09,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:09,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529108188] [2022-02-20 18:47:09,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529108188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:09,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:09,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:47:09,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533973329] [2022-02-20 18:47:09,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:09,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:47:09,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:09,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:09,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:09,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:09,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:09,338 INFO L87 Difference]: Start difference. First operand 795 states and 1211 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:11,238 INFO L93 Difference]: Finished difference Result 2127 states and 3281 transitions. [2022-02-20 18:47:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:47:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-02-20 18:47:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-02-20 18:47:11,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-02-20 18:47:11,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:11,742 INFO L225 Difference]: With dead ends: 2127 [2022-02-20 18:47:11,742 INFO L226 Difference]: Without dead ends: 1383 [2022-02-20 18:47:11,744 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:47:11,745 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 994 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:11,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [994 Valid, 244 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-02-20 18:47:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2022-02-20 18:47:12,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:13,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1383 states. Second operand has 1381 states, 1380 states have (on average 1.5333333333333334) internal successors, (2116), 1380 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:13,002 INFO L74 IsIncluded]: Start isIncluded. First operand 1383 states. Second operand has 1381 states, 1380 states have (on average 1.5333333333333334) internal successors, (2116), 1380 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:13,005 INFO L87 Difference]: Start difference. First operand 1383 states. Second operand has 1381 states, 1380 states have (on average 1.5333333333333334) internal successors, (2116), 1380 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:13,065 INFO L93 Difference]: Finished difference Result 1383 states and 2117 transitions. [2022-02-20 18:47:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2117 transitions. [2022-02-20 18:47:13,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:13,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:13,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 1381 states, 1380 states have (on average 1.5333333333333334) internal successors, (2116), 1380 states have internal predecessors, (2116), 0 states have call successors, (0), 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 1383 states. [2022-02-20 18:47:13,072 INFO L87 Difference]: Start difference. First operand has 1381 states, 1380 states have (on average 1.5333333333333334) internal successors, (2116), 1380 states have internal predecessors, (2116), 0 states have call successors, (0), 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 1383 states. [2022-02-20 18:47:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:13,132 INFO L93 Difference]: Finished difference Result 1383 states and 2117 transitions. [2022-02-20 18:47:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2117 transitions. [2022-02-20 18:47:13,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:13,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:13,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:13,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1380 states have (on average 1.5333333333333334) internal successors, (2116), 1380 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2116 transitions. [2022-02-20 18:47:13,217 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2116 transitions. Word has length 67 [2022-02-20 18:47:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:13,218 INFO L470 AbstractCegarLoop]: Abstraction has 1381 states and 2116 transitions. [2022-02-20 18:47:13,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2116 transitions. [2022-02-20 18:47:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:47:13,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:13,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:13,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:47:13,222 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash -301249106, now seen corresponding path program 1 times [2022-02-20 18:47:13,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:13,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215001577] [2022-02-20 18:47:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:13,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {13982#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19388~0 := 0;~__tmp_19535_0~0 := 0;~__return_19551~0 := 0;~__return_19565~0 := 0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {13984#(<= (+ ~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_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#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_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {13984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:13,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {13984#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {13985#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:47:13,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {13985#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {13985#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:47:13,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {13985#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive1~0 % 256); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send1~0 != ~id1~0); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive2~0 % 256); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~id2~0); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive3~0 % 256); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~id3~0); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256); {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == ~alive4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:47:13,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {13986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13983#false} is VALID [2022-02-20 18:47:13,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {13983#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256); {13983#false} is VALID [2022-02-20 18:47:13,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {13983#false} ~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13983#false} is VALID [2022-02-20 18:47:13,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {13983#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13983#false} is VALID [2022-02-20 18:47:13,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {13983#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_19388~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19388~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {13983#false} is VALID [2022-02-20 18:47:13,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {13983#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {13983#false} is VALID [2022-02-20 18:47:13,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {13983#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {13983#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {13983#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13983#false} is VALID [2022-02-20 18:47:13,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {13983#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {13983#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {13983#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {13983#false} is VALID [2022-02-20 18:47:13,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {13983#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {13983#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {13983#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13983#false} is VALID [2022-02-20 18:47:13,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {13983#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,352 INFO L290 TraceCheckUtils]: 58: Hoare triple {13983#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13983#false} is VALID [2022-02-20 18:47:13,352 INFO L290 TraceCheckUtils]: 59: Hoare triple {13983#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {13983#false} is VALID [2022-02-20 18:47:13,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {13983#false} ~mode4~0 := 0;~__tmp_19535_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13983#false} is VALID [2022-02-20 18:47:13,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {13983#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_19535_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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {13983#false} is VALID [2022-02-20 18:47:13,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {13983#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13983#false} is VALID [2022-02-20 18:47:13,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {13983#false} assume ~r1~0 < 4;main_~check__tmp~1#1 := 1; {13983#false} is VALID [2022-02-20 18:47:13,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {13983#false} ~__return_19551~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19551~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {13983#false} is VALID [2022-02-20 18:47:13,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {13983#false} assume 0 == main_~assert__arg~1#1 % 256; {13983#false} is VALID [2022-02-20 18:47:13,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {13983#false} assume !false; {13983#false} is VALID [2022-02-20 18:47:13,353 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:47:13,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:13,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215001577] [2022-02-20 18:47:13,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215001577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:13,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:13,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:47:13,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430385802] [2022-02-20 18:47:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:13,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:47:13,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:13,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:13,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:13,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:13,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:13,393 INFO L87 Difference]: Start difference. First operand 1381 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:17,316 INFO L93 Difference]: Finished difference Result 3713 states and 5742 transitions. [2022-02-20 18:47:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:17,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:47:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-02-20 18:47:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-02-20 18:47:17,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 558 transitions. [2022-02-20 18:47:17,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:17,910 INFO L225 Difference]: With dead ends: 3713 [2022-02-20 18:47:17,910 INFO L226 Difference]: Without dead ends: 2433 [2022-02-20 18:47:17,911 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:47:17,912 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 920 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:17,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [920 Valid, 250 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2022-02-20 18:47:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2431. [2022-02-20 18:47:20,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:20,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2433 states. Second operand has 2431 states, 2430 states have (on average 1.536625514403292) internal successors, (3734), 2430 states have internal predecessors, (3734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:20,742 INFO L74 IsIncluded]: Start isIncluded. First operand 2433 states. Second operand has 2431 states, 2430 states have (on average 1.536625514403292) internal successors, (3734), 2430 states have internal predecessors, (3734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:20,746 INFO L87 Difference]: Start difference. First operand 2433 states. Second operand has 2431 states, 2430 states have (on average 1.536625514403292) internal successors, (3734), 2430 states have internal predecessors, (3734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:20,930 INFO L93 Difference]: Finished difference Result 2433 states and 3735 transitions. [2022-02-20 18:47:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3735 transitions. [2022-02-20 18:47:20,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:20,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:20,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 2431 states, 2430 states have (on average 1.536625514403292) internal successors, (3734), 2430 states have internal predecessors, (3734), 0 states have call successors, (0), 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 2433 states. [2022-02-20 18:47:20,940 INFO L87 Difference]: Start difference. First operand has 2431 states, 2430 states have (on average 1.536625514403292) internal successors, (3734), 2430 states have internal predecessors, (3734), 0 states have call successors, (0), 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 2433 states. [2022-02-20 18:47:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:21,135 INFO L93 Difference]: Finished difference Result 2433 states and 3735 transitions. [2022-02-20 18:47:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3735 transitions. [2022-02-20 18:47:21,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:21,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:21,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:21,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2430 states have (on average 1.536625514403292) internal successors, (3734), 2430 states have internal predecessors, (3734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3734 transitions. [2022-02-20 18:47:21,398 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3734 transitions. Word has length 67 [2022-02-20 18:47:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:21,398 INFO L470 AbstractCegarLoop]: Abstraction has 2431 states and 3734 transitions. [2022-02-20 18:47:21,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3734 transitions. [2022-02-20 18:47:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:47:21,399 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:21,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:21,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:47:21,400 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1722644829, now seen corresponding path program 1 times [2022-02-20 18:47:21,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:21,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503965194] [2022-02-20 18:47:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:21,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {27233#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19388~0 := 0;~__tmp_19535_0~0 := 0;~__return_19551~0 := 0;~__return_19565~0 := 0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {27235#(<= (+ ~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_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#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_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {27235#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:21,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {27235#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {27236#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:47:21,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {27236#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {27236#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:47:21,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {27236#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {27237#(<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send1~0 != ~id1~0); {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {27237#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {27237#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {27234#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {27234#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {27234#false} assume !!(0 == ~mode4~0 % 256); {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {27234#false} assume !!(0 == ~alive4~0 % 256); {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {27234#false} assume !(~send4~0 != ~id4~0); {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {27234#false} ~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {27234#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {27234#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_19388~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19388~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {27234#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {27234#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {27234#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {27234#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {27234#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {27234#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 53: Hoare triple {27234#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {27234#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {27234#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {27234#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {27234#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {27234#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {27234#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {27234#false} ~mode4~0 := 0;~__tmp_19535_0~0 := main_~main____CPAchecker_TMP_0~0#1; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {27234#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_19535_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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {27234#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {27234#false} is VALID [2022-02-20 18:47:21,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {27234#false} assume ~r1~0 < 4;main_~check__tmp~1#1 := 1; {27234#false} is VALID [2022-02-20 18:47:21,494 INFO L290 TraceCheckUtils]: 64: Hoare triple {27234#false} ~__return_19551~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19551~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {27234#false} is VALID [2022-02-20 18:47:21,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {27234#false} assume 0 == main_~assert__arg~1#1 % 256; {27234#false} is VALID [2022-02-20 18:47:21,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {27234#false} assume !false; {27234#false} is VALID [2022-02-20 18:47:21,494 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:47:21,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:21,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503965194] [2022-02-20 18:47:21,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503965194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:21,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:21,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:47:21,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136376866] [2022-02-20 18:47:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:21,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:47:21,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:21,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:21,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:21,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:21,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:21,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:21,541 INFO L87 Difference]: Start difference. First operand 2431 states and 3734 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:30,339 INFO L93 Difference]: Finished difference Result 6934 states and 10705 transitions. [2022-02-20 18:47:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:47:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-02-20 18:47:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-02-20 18:47:30,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 578 transitions. [2022-02-20 18:47:30,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 578 edges. 578 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:31,560 INFO L225 Difference]: With dead ends: 6934 [2022-02-20 18:47:31,560 INFO L226 Difference]: Without dead ends: 4577 [2022-02-20 18:47:31,562 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:47:31,563 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 946 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:31,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [946 Valid, 248 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2022-02-20 18:47:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 4575. [2022-02-20 18:47:37,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:37,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4577 states. Second operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:37,858 INFO L74 IsIncluded]: Start isIncluded. First operand 4577 states. Second operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:37,862 INFO L87 Difference]: Start difference. First operand 4577 states. Second operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:38,484 INFO L93 Difference]: Finished difference Result 4577 states and 7019 transitions. [2022-02-20 18:47:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 7019 transitions. [2022-02-20 18:47:38,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:38,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:38,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 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 4577 states. [2022-02-20 18:47:38,499 INFO L87 Difference]: Start difference. First operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 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 4577 states. [2022-02-20 18:47:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:39,125 INFO L93 Difference]: Finished difference Result 4577 states and 7019 transitions. [2022-02-20 18:47:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 7019 transitions. [2022-02-20 18:47:39,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:39,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:39,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:39,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 7018 transitions. [2022-02-20 18:47:40,051 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 7018 transitions. Word has length 67 [2022-02-20 18:47:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:40,052 INFO L470 AbstractCegarLoop]: Abstraction has 4575 states and 7018 transitions. [2022-02-20 18:47:40,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 7018 transitions. [2022-02-20 18:47:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:47:40,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:40,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:40,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:47:40,053 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash -262843909, now seen corresponding path program 1 times [2022-02-20 18:47:40,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:40,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58776712] [2022-02-20 18:47:40,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:40,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:40,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {52207#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19388~0 := 0;~__tmp_19535_0~0 := 0;~__return_19551~0 := 0;~__return_19565~0 := 0; {52209#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:40,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {52209#(<= (+ ~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_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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~1#1, main_~node1____CPAchecker_TMP_1~0#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_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {52209#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:40,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {52209#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {52209#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:40,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {52209#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {52209#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:40,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {52209#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {52210#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:47:40,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {52210#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {52210#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:47:40,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {52210#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {52211#(<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {52211#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:40,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {52211#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {52208#false} is VALID [2022-02-20 18:47:40,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {52208#false} ~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); {52208#false} is VALID [2022-02-20 18:47:40,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {52208#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {52208#false} assume !!(0 == ~mode2~0 % 256); {52208#false} is VALID [2022-02-20 18:47:40,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {52208#false} assume !!(0 == ~alive2~0 % 256); {52208#false} is VALID [2022-02-20 18:47:40,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {52208#false} assume !(~send2~0 != ~id2~0); {52208#false} is VALID [2022-02-20 18:47:40,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {52208#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {52208#false} assume !!(0 == ~mode3~0 % 256); {52208#false} is VALID [2022-02-20 18:47:40,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {52208#false} assume !!(0 == ~alive3~0 % 256); {52208#false} is VALID [2022-02-20 18:47:40,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {52208#false} assume !(~send3~0 != ~id3~0); {52208#false} is VALID [2022-02-20 18:47:40,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {52208#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {52208#false} assume !!(0 == ~mode4~0 % 256); {52208#false} is VALID [2022-02-20 18:47:40,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {52208#false} assume !!(0 == ~alive4~0 % 256); {52208#false} is VALID [2022-02-20 18:47:40,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {52208#false} assume !(~send4~0 != ~id4~0); {52208#false} is VALID [2022-02-20 18:47:40,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {52208#false} ~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {52208#false} is VALID [2022-02-20 18:47:40,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {52208#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {52208#false} is VALID [2022-02-20 18:47:40,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {52208#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_19388~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19388~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {52208#false} is VALID [2022-02-20 18:47:40,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {52208#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {52208#false} is VALID [2022-02-20 18:47:40,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {52208#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {52208#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {52208#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {52208#false} is VALID [2022-02-20 18:47:40,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {52208#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {52208#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {52208#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {52208#false} is VALID [2022-02-20 18:47:40,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {52208#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {52208#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {52208#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {52208#false} is VALID [2022-02-20 18:47:40,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {52208#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {52208#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {52208#false} is VALID [2022-02-20 18:47:40,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {52208#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {52208#false} is VALID [2022-02-20 18:47:40,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {52208#false} ~mode4~0 := 0;~__tmp_19535_0~0 := main_~main____CPAchecker_TMP_0~0#1; {52208#false} is VALID [2022-02-20 18:47:40,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {52208#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_19535_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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {52208#false} is VALID [2022-02-20 18:47:40,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {52208#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {52208#false} is VALID [2022-02-20 18:47:40,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {52208#false} assume ~r1~0 < 4;main_~check__tmp~1#1 := 1; {52208#false} is VALID [2022-02-20 18:47:40,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {52208#false} ~__return_19551~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_19551~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {52208#false} is VALID [2022-02-20 18:47:40,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {52208#false} assume 0 == main_~assert__arg~1#1 % 256; {52208#false} is VALID [2022-02-20 18:47:40,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {52208#false} assume !false; {52208#false} is VALID [2022-02-20 18:47:40,158 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:47:40,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:40,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58776712] [2022-02-20 18:47:40,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58776712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:40,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:40,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:47:40,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352683154] [2022-02-20 18:47:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:47:40,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:40,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:40,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:40,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:40,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:40,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:40,209 INFO L87 Difference]: Start difference. First operand 4575 states and 7018 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:00,356 INFO L93 Difference]: Finished difference Result 12541 states and 19291 transitions. [2022-02-20 18:48:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:48:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2022-02-20 18:48:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2022-02-20 18:48:00,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 620 transitions. [2022-02-20 18:48:00,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:03,497 INFO L225 Difference]: With dead ends: 12541 [2022-02-20 18:48:03,497 INFO L226 Difference]: Without dead ends: 8001 [2022-02-20 18:48:03,501 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:48:03,502 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 1008 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:03,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1008 Valid, 242 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states.