./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.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.5.2.ufo.UNBOUNDED.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 eb6a86313c6847913ca8b6f4f78c128447d9c9cbacc492e7ef1a5540e3f6a711 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:48:19,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:48:19,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:48:19,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:48:19,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:48:19,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:48:19,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:48:19,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:48:19,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:48:19,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:48:19,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:48:19,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:48:19,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:48:19,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:48:19,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:48:19,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:48:19,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:48:19,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:48:19,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:48:19,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:48:19,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:48:19,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:48:19,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:48:19,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:48:19,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:48:19,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:48:19,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:48:19,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:48:19,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:48:19,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:48:19,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:48:19,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:48:19,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:48:19,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:48:19,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:48:19,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:48:19,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:48:19,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:48:19,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:48:19,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:48:19,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:48:19,577 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:48:19,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:48:19,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:48:19,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:48:19,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:48:19,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:48:19,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:48:19,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:48:19,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:48:19,604 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:48:19,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:48:19,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:48:19,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:48:19,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:48:19,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:48:19,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:48:19,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:48:19,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:48:19,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:48:19,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:48:19,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:48:19,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:48:19,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:48:19,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:48:19,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:48:19,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:19,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:48:19,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:48:19,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:48:19,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:48:19,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:48:19,608 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:48:19,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:48:19,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:48:19,608 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 -> eb6a86313c6847913ca8b6f4f78c128447d9c9cbacc492e7ef1a5540e3f6a711 [2022-02-20 18:48:19,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:48:19,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:48:19,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:48:19,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:48:19,832 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:48:19,833 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.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:48:19,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb524ee8/67e10c7b231c45a79c8702b42b1ce1cd/FLAG33b253ba8 [2022-02-20 18:48:20,260 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:48:20,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:48:20,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb524ee8/67e10c7b231c45a79c8702b42b1ce1cd/FLAG33b253ba8 [2022-02-20 18:48:20,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb524ee8/67e10c7b231c45a79c8702b42b1ce1cd [2022-02-20 18:48:20,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:48:20,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:48:20,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:20,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:48:20,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:48:20,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:20" (1/1) ... [2022-02-20 18:48:20,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6053e1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:20, skipping insertion in model container [2022-02-20 18:48:20,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:20" (1/1) ... [2022-02-20 18:48:20,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:48:20,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:48:20,916 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.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2022-02-20 18:48:20,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:20,969 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:48:21,029 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.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2022-02-20 18:48:21,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:21,079 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:48:21,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21 WrapperNode [2022-02-20 18:48:21,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:21,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:21,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:48:21,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:48:21,086 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:48:21" (1/1) ... [2022-02-20 18:48:21,104 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:48:21" (1/1) ... [2022-02-20 18:48:21,142 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 766 [2022-02-20 18:48:21,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:21,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:48:21,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:48:21,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:48:21,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:48:21,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:48:21,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:48:21,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:48:21,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (1/1) ... [2022-02-20 18:48:21,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:48:21,222 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:48:21,227 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:48:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:48:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:48:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:48:21,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:48:21,369 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:48:21,370 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:48:21,979 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:48:21,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:48:21,985 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:48:21,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:21 BoogieIcfgContainer [2022-02-20 18:48:21,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:48:21,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:48:21,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:48:21,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:48:21,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:48:20" (1/3) ... [2022-02-20 18:48:21,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9bc775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:21, skipping insertion in model container [2022-02-20 18:48:21,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:21" (2/3) ... [2022-02-20 18:48:21,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9bc775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:21, skipping insertion in model container [2022-02-20 18:48:21,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:21" (3/3) ... [2022-02-20 18:48:21,992 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:48:21,995 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:48:21,995 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:48:22,027 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:48:22,031 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:48:22,031 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:48:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.7205882352941178) internal successors, (351), 205 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call 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:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:48:22,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:22,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:22,063 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -465870500, now seen corresponding path program 1 times [2022-02-20 18:48:22,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:22,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858226617] [2022-02-20 18:48:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:22,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {209#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33277~0 := 0;~__return_33467~0 := 0; {209#true} is VALID [2022-02-20 18:48:22,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#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__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~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__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {209#true} is VALID [2022-02-20 18:48:22,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#true} assume 0 == ~r1~0 % 256; {209#true} is VALID [2022-02-20 18:48:22,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {209#true} is VALID [2022-02-20 18:48:22,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {209#true} assume ~id1~0 >= 0; {209#true} is VALID [2022-02-20 18:48:22,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#true} assume 0 == ~st1~0; {211#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:22,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {211#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:22,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {211#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:22,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(<= ~st1~0 0)} assume ~id2~0 >= 0; {211#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:22,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(<= ~st1~0 0)} assume 0 == ~st2~0; {212#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {212#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {212#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {212#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {212#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {213#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {214#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {215#(<= (+ ~st5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,416 INFO L290 TraceCheckUtils]: 49: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,416 INFO L290 TraceCheckUtils]: 50: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive5~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_33277~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33277~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,430 INFO L290 TraceCheckUtils]: 67: Hoare triple {215#(<= (+ ~st5~0 ~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; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,433 INFO L290 TraceCheckUtils]: 73: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:22,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {215#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {210#false} is VALID [2022-02-20 18:48:22,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {210#false} ~__return_33467~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33467~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; {210#false} is VALID [2022-02-20 18:48:22,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {210#false} assume 0 == main_~assert__arg~1#1 % 256; {210#false} is VALID [2022-02-20 18:48:22,436 INFO L290 TraceCheckUtils]: 78: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-02-20 18:48:22,439 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:48:22,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:22,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858226617] [2022-02-20 18:48:22,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858226617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:22,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:22,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:48:22,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557771217] [2022-02-20 18:48:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:48:22,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:22,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call 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:22,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:22,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:48:22,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:22,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:48:22,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:22,554 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.7205882352941178) internal successors, (351), 205 states have internal predecessors, (351), 0 states have call successors, (0), 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 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call 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:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:24,669 INFO L93 Difference]: Finished difference Result 828 states and 1339 transitions. [2022-02-20 18:48:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:48:24,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:48:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call 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:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1339 transitions. [2022-02-20 18:48:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call 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:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1339 transitions. [2022-02-20 18:48:24,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1339 transitions. [2022-02-20 18:48:25,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1339 edges. 1339 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:25,664 INFO L225 Difference]: With dead ends: 828 [2022-02-20 18:48:25,665 INFO L226 Difference]: Without dead ends: 713 [2022-02-20 18:48:25,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:48:25,670 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 2417 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:25,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2417 Valid, 2321 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-02-20 18:48:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 314. [2022-02-20 18:48:25,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:25,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 713 states. Second operand has 314 states, 313 states have (on average 1.5047923322683705) internal successors, (471), 313 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call 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:25,811 INFO L74 IsIncluded]: Start isIncluded. First operand 713 states. Second operand has 314 states, 313 states have (on average 1.5047923322683705) internal successors, (471), 313 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call 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:25,812 INFO L87 Difference]: Start difference. First operand 713 states. Second operand has 314 states, 313 states have (on average 1.5047923322683705) internal successors, (471), 313 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call 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:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:25,834 INFO L93 Difference]: Finished difference Result 713 states and 1105 transitions. [2022-02-20 18:48:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1105 transitions. [2022-02-20 18:48:25,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:25,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:25,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 313 states have (on average 1.5047923322683705) internal successors, (471), 313 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 713 states. [2022-02-20 18:48:25,838 INFO L87 Difference]: Start difference. First operand has 314 states, 313 states have (on average 1.5047923322683705) internal successors, (471), 313 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 713 states. [2022-02-20 18:48:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:25,859 INFO L93 Difference]: Finished difference Result 713 states and 1105 transitions. [2022-02-20 18:48:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1105 transitions. [2022-02-20 18:48:25,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:25,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:25,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:25,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 1.5047923322683705) internal successors, (471), 313 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call 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:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 471 transitions. [2022-02-20 18:48:25,869 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 471 transitions. Word has length 79 [2022-02-20 18:48:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:25,870 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 471 transitions. [2022-02-20 18:48:25,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call 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:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 471 transitions. [2022-02-20 18:48:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:48:25,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:25,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:25,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:48:25,872 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1819425779, now seen corresponding path program 1 times [2022-02-20 18:48:25,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:25,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092615163] [2022-02-20 18:48:25,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:26,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {3167#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33277~0 := 0;~__return_33467~0 := 0; {3167#true} is VALID [2022-02-20 18:48:26,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#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__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~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__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {3167#true} is VALID [2022-02-20 18:48:26,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume 0 == ~r1~0 % 256; {3167#true} is VALID [2022-02-20 18:48:26,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {3167#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:26,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {3169#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {3170#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:26,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {3170#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3170#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:26,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {3170#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {3170#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:26,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {3170#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:26,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:26,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:26,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:26,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {3171#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:26,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:26,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:26,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:26,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {3172#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:26,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:26,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:26,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~mode5~0 % 256); {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:26,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {3173#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~alive5~0 % 256); {3168#false} is VALID [2022-02-20 18:48:26,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {3168#false} assume !(~send5~0 != ~id5~0); {3168#false} is VALID [2022-02-20 18:48:26,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {3168#false} ~mode5~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3168#false} is VALID [2022-02-20 18:48:26,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {3168#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3168#false} is VALID [2022-02-20 18:48:26,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {3168#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_33277~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33277~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; {3168#false} is VALID [2022-02-20 18:48:26,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {3168#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {3168#false} assume !(0 == ~mode1~0 % 256); {3168#false} is VALID [2022-02-20 18:48:26,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {3168#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {3168#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3168#false} is VALID [2022-02-20 18:48:26,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {3168#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {3168#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {3168#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3168#false} is VALID [2022-02-20 18:48:26,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {3168#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {3168#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {3168#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {3168#false} is VALID [2022-02-20 18:48:26,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {3168#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {3168#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,063 INFO L290 TraceCheckUtils]: 68: Hoare triple {3168#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3168#false} is VALID [2022-02-20 18:48:26,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {3168#false} ~mode4~0 := 0; {3168#false} is VALID [2022-02-20 18:48:26,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {3168#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,063 INFO L290 TraceCheckUtils]: 71: Hoare triple {3168#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3168#false} is VALID [2022-02-20 18:48:26,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {3168#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3168#false} is VALID [2022-02-20 18:48:26,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {3168#false} ~mode5~0 := 0; {3168#false} is VALID [2022-02-20 18:48:26,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {3168#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {3168#false} is VALID [2022-02-20 18:48:26,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {3168#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3168#false} is VALID [2022-02-20 18:48:26,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {3168#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {3168#false} is VALID [2022-02-20 18:48:26,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {3168#false} ~__return_33467~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33467~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; {3168#false} is VALID [2022-02-20 18:48:26,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {3168#false} assume 0 == main_~assert__arg~1#1 % 256; {3168#false} is VALID [2022-02-20 18:48:26,064 INFO L290 TraceCheckUtils]: 79: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-02-20 18:48:26,065 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:48:26,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:26,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092615163] [2022-02-20 18:48:26,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092615163] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:26,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:26,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:48:26,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619720864] [2022-02-20 18:48:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:26,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:48:26,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:26,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call 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:26,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:26,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:48:26,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:26,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:48:26,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:26,146 INFO L87 Difference]: Start difference. First operand 314 states and 471 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call 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:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:28,277 INFO L93 Difference]: Finished difference Result 1370 states and 2124 transitions. [2022-02-20 18:48:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:48:28,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:48:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call 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:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1212 transitions. [2022-02-20 18:48:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call 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:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1212 transitions. [2022-02-20 18:48:28,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1212 transitions. [2022-02-20 18:48:29,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1212 edges. 1212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:29,254 INFO L225 Difference]: With dead ends: 1370 [2022-02-20 18:48:29,255 INFO L226 Difference]: Without dead ends: 1132 [2022-02-20 18:48:29,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:29,257 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1330 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:29,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1330 Valid, 1209 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-02-20 18:48:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1124. [2022-02-20 18:48:29,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:29,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1132 states. Second operand has 1124 states, 1123 states have (on average 1.545859305431879) internal successors, (1736), 1123 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call 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:29,950 INFO L74 IsIncluded]: Start isIncluded. First operand 1132 states. Second operand has 1124 states, 1123 states have (on average 1.545859305431879) internal successors, (1736), 1123 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call 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:29,952 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand has 1124 states, 1123 states have (on average 1.545859305431879) internal successors, (1736), 1123 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call 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:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:30,001 INFO L93 Difference]: Finished difference Result 1132 states and 1740 transitions. [2022-02-20 18:48:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1740 transitions. [2022-02-20 18:48:30,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:30,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:30,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 1124 states, 1123 states have (on average 1.545859305431879) internal successors, (1736), 1123 states have internal predecessors, (1736), 0 states have call successors, (0), 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 1132 states. [2022-02-20 18:48:30,007 INFO L87 Difference]: Start difference. First operand has 1124 states, 1123 states have (on average 1.545859305431879) internal successors, (1736), 1123 states have internal predecessors, (1736), 0 states have call successors, (0), 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 1132 states. [2022-02-20 18:48:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:30,047 INFO L93 Difference]: Finished difference Result 1132 states and 1740 transitions. [2022-02-20 18:48:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1740 transitions. [2022-02-20 18:48:30,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:30,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:30,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:30,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1123 states have (on average 1.545859305431879) internal successors, (1736), 1123 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call 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:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1736 transitions. [2022-02-20 18:48:30,116 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1736 transitions. Word has length 80 [2022-02-20 18:48:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:30,117 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 1736 transitions. [2022-02-20 18:48:30,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call 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:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1736 transitions. [2022-02-20 18:48:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:48:30,119 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:30,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:30,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:48:30,120 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:30,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1286257119, now seen corresponding path program 1 times [2022-02-20 18:48:30,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:30,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452667768] [2022-02-20 18:48:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:30,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {8756#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33277~0 := 0;~__return_33467~0 := 0; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {8758#(<= (+ ~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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#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__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~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__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {8758#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:30,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {8758#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {8759#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:48:30,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {8759#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {8759#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:48:30,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {8759#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 >= 0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st5~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send5~0 == ~id5~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode5~0 % 256; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id5~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id5~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id5~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {8760#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8760#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:30,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {8760#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {8757#false} is VALID [2022-02-20 18:48:30,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {8757#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); {8757#false} is VALID [2022-02-20 18:48:30,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {8757#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {8757#false} assume !!(0 == ~mode4~0 % 256); {8757#false} is VALID [2022-02-20 18:48:30,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {8757#false} assume !!(0 == ~alive4~0 % 256); {8757#false} is VALID [2022-02-20 18:48:30,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {8757#false} assume !(~send4~0 != ~id4~0); {8757#false} is VALID [2022-02-20 18:48:30,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {8757#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {8757#false} assume !!(0 == ~mode5~0 % 256); {8757#false} is VALID [2022-02-20 18:48:30,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {8757#false} assume !!(0 == ~alive5~0 % 256); {8757#false} is VALID [2022-02-20 18:48:30,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {8757#false} assume !(~send5~0 != ~id5~0); {8757#false} is VALID [2022-02-20 18:48:30,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {8757#false} ~mode5~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8757#false} is VALID [2022-02-20 18:48:30,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {8757#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {8757#false} is VALID [2022-02-20 18:48:30,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {8757#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_33277~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33277~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; {8757#false} is VALID [2022-02-20 18:48:30,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {8757#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {8757#false} assume !(0 == ~mode1~0 % 256); {8757#false} is VALID [2022-02-20 18:48:30,222 INFO L290 TraceCheckUtils]: 59: Hoare triple {8757#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {8757#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8757#false} is VALID [2022-02-20 18:48:30,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {8757#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {8757#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,222 INFO L290 TraceCheckUtils]: 63: Hoare triple {8757#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {8757#false} is VALID [2022-02-20 18:48:30,222 INFO L290 TraceCheckUtils]: 64: Hoare triple {8757#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {8757#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {8757#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {8757#false} is VALID [2022-02-20 18:48:30,223 INFO L290 TraceCheckUtils]: 67: Hoare triple {8757#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,223 INFO L290 TraceCheckUtils]: 68: Hoare triple {8757#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,223 INFO L290 TraceCheckUtils]: 69: Hoare triple {8757#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {8757#false} is VALID [2022-02-20 18:48:30,223 INFO L290 TraceCheckUtils]: 70: Hoare triple {8757#false} ~mode4~0 := 0; {8757#false} is VALID [2022-02-20 18:48:30,223 INFO L290 TraceCheckUtils]: 71: Hoare triple {8757#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {8757#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8757#false} is VALID [2022-02-20 18:48:30,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {8757#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {8757#false} is VALID [2022-02-20 18:48:30,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {8757#false} ~mode5~0 := 0; {8757#false} is VALID [2022-02-20 18:48:30,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {8757#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {8757#false} is VALID [2022-02-20 18:48:30,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {8757#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {8757#false} is VALID [2022-02-20 18:48:30,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {8757#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {8757#false} is VALID [2022-02-20 18:48:30,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {8757#false} ~__return_33467~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33467~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; {8757#false} is VALID [2022-02-20 18:48:30,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {8757#false} assume 0 == main_~assert__arg~1#1 % 256; {8757#false} is VALID [2022-02-20 18:48:30,225 INFO L290 TraceCheckUtils]: 80: Hoare triple {8757#false} assume !false; {8757#false} is VALID [2022-02-20 18:48:30,225 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:48:30,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:30,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452667768] [2022-02-20 18:48:30,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452667768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:30,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:30,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:30,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211532555] [2022-02-20 18:48:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:30,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:48:30,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:30,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:30,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:30,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:30,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:30,273 INFO L87 Difference]: Start difference. First operand 1124 states and 1736 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:33,041 INFO L93 Difference]: Finished difference Result 2981 states and 4661 transitions. [2022-02-20 18:48:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:48:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2022-02-20 18:48:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2022-02-20 18:48:33,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 679 transitions. [2022-02-20 18:48:33,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:33,622 INFO L225 Difference]: With dead ends: 2981 [2022-02-20 18:48:33,623 INFO L226 Difference]: Without dead ends: 1934 [2022-02-20 18:48:33,624 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:33,625 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 1107 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:33,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 287 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2022-02-20 18:48:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1932. [2022-02-20 18:48:35,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:35,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1934 states. Second operand has 1932 states, 1931 states have (on average 1.5546349041947178) internal successors, (3002), 1931 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call 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:35,475 INFO L74 IsIncluded]: Start isIncluded. First operand 1934 states. Second operand has 1932 states, 1931 states have (on average 1.5546349041947178) internal successors, (3002), 1931 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call 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:35,478 INFO L87 Difference]: Start difference. First operand 1934 states. Second operand has 1932 states, 1931 states have (on average 1.5546349041947178) internal successors, (3002), 1931 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call 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:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:35,584 INFO L93 Difference]: Finished difference Result 1934 states and 3003 transitions. [2022-02-20 18:48:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 3003 transitions. [2022-02-20 18:48:35,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:35,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:35,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 1932 states, 1931 states have (on average 1.5546349041947178) internal successors, (3002), 1931 states have internal predecessors, (3002), 0 states have call successors, (0), 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 1934 states. [2022-02-20 18:48:35,592 INFO L87 Difference]: Start difference. First operand has 1932 states, 1931 states have (on average 1.5546349041947178) internal successors, (3002), 1931 states have internal predecessors, (3002), 0 states have call successors, (0), 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 1934 states. [2022-02-20 18:48:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:35,696 INFO L93 Difference]: Finished difference Result 1934 states and 3003 transitions. [2022-02-20 18:48:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 3003 transitions. [2022-02-20 18:48:35,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:35,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:35,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:35,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1931 states have (on average 1.5546349041947178) internal successors, (3002), 1931 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call 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:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 3002 transitions. [2022-02-20 18:48:35,851 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 3002 transitions. Word has length 81 [2022-02-20 18:48:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:35,851 INFO L470 AbstractCegarLoop]: Abstraction has 1932 states and 3002 transitions. [2022-02-20 18:48:35,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 3002 transitions. [2022-02-20 18:48:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:48:35,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:35,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:35,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:48:35,853 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash 963502145, now seen corresponding path program 1 times [2022-02-20 18:48:35,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:35,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748541500] [2022-02-20 18:48:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:35,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:35,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {19272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33277~0 := 0;~__return_33467~0 := 0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {19274#(<= (+ ~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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#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__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~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__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {19274#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:35,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {19274#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {19275#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:48:35,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {19275#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {19275#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:48:35,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {19275#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive1~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive2~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~id2~0); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive3~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~id3~0); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive4~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~id4~0); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256); {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,953 INFO L290 TraceCheckUtils]: 51: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(0 == ~alive5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {19276#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:35,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {19276#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {19273#false} is VALID [2022-02-20 18:48:35,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {19273#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256); {19273#false} is VALID [2022-02-20 18:48:35,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {19273#false} ~mode5~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19273#false} is VALID [2022-02-20 18:48:35,954 INFO L290 TraceCheckUtils]: 55: Hoare triple {19273#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {19273#false} is VALID [2022-02-20 18:48:35,954 INFO L290 TraceCheckUtils]: 56: Hoare triple {19273#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_33277~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33277~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; {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {19273#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {19273#false} assume !(0 == ~mode1~0 % 256); {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {19273#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {19273#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {19273#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {19273#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {19273#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {19273#false} is VALID [2022-02-20 18:48:35,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {19273#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {19273#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {19273#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {19273#false} is VALID [2022-02-20 18:48:35,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {19273#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,956 INFO L290 TraceCheckUtils]: 68: Hoare triple {19273#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {19273#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {19273#false} is VALID [2022-02-20 18:48:35,956 INFO L290 TraceCheckUtils]: 70: Hoare triple {19273#false} ~mode4~0 := 0; {19273#false} is VALID [2022-02-20 18:48:35,956 INFO L290 TraceCheckUtils]: 71: Hoare triple {19273#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {19273#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {19273#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {19273#false} ~mode5~0 := 0; {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {19273#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {19273#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {19273#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 78: Hoare triple {19273#false} ~__return_33467~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33467~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; {19273#false} is VALID [2022-02-20 18:48:35,957 INFO L290 TraceCheckUtils]: 79: Hoare triple {19273#false} assume 0 == main_~assert__arg~1#1 % 256; {19273#false} is VALID [2022-02-20 18:48:35,958 INFO L290 TraceCheckUtils]: 80: Hoare triple {19273#false} assume !false; {19273#false} is VALID [2022-02-20 18:48:35,958 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:48:35,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:35,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748541500] [2022-02-20 18:48:35,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748541500] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:35,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:35,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:35,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186049143] [2022-02-20 18:48:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:48:35,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:35,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:36,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:36,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:36,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:36,003 INFO L87 Difference]: Start difference. First operand 1932 states and 3002 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:41,611 INFO L93 Difference]: Finished difference Result 5245 states and 8233 transitions. [2022-02-20 18:48:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:48:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-02-20 18:48:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-02-20 18:48:41,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 638 transitions. [2022-02-20 18:48:41,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:42,488 INFO L225 Difference]: With dead ends: 5245 [2022-02-20 18:48:42,488 INFO L226 Difference]: Without dead ends: 3454 [2022-02-20 18:48:42,490 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:42,490 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 1063 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:42,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 298 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2022-02-20 18:48:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2022-02-20 18:48:46,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:46,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3454 states. Second operand has 3452 states, 3451 states have (on average 1.5609968125181106) internal successors, (5387), 3451 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states have call 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:46,523 INFO L74 IsIncluded]: Start isIncluded. First operand 3454 states. Second operand has 3452 states, 3451 states have (on average 1.5609968125181106) internal successors, (5387), 3451 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states have call 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:46,532 INFO L87 Difference]: Start difference. First operand 3454 states. Second operand has 3452 states, 3451 states have (on average 1.5609968125181106) internal successors, (5387), 3451 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states have call 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:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:46,899 INFO L93 Difference]: Finished difference Result 3454 states and 5388 transitions. [2022-02-20 18:48:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5388 transitions. [2022-02-20 18:48:46,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:46,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:46,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 3452 states, 3451 states have (on average 1.5609968125181106) internal successors, (5387), 3451 states have internal predecessors, (5387), 0 states have call successors, (0), 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 3454 states. [2022-02-20 18:48:46,911 INFO L87 Difference]: Start difference. First operand has 3452 states, 3451 states have (on average 1.5609968125181106) internal successors, (5387), 3451 states have internal predecessors, (5387), 0 states have call successors, (0), 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 3454 states. [2022-02-20 18:48:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:47,247 INFO L93 Difference]: Finished difference Result 3454 states and 5388 transitions. [2022-02-20 18:48:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5388 transitions. [2022-02-20 18:48:47,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:47,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:47,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:47,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.5609968125181106) internal successors, (5387), 3451 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states have call 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:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5387 transitions. [2022-02-20 18:48:47,730 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5387 transitions. Word has length 81 [2022-02-20 18:48:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:47,730 INFO L470 AbstractCegarLoop]: Abstraction has 3452 states and 5387 transitions. [2022-02-20 18:48:47,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5387 transitions. [2022-02-20 18:48:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:48:47,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:47,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:47,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:48:47,732 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash -990576080, now seen corresponding path program 1 times [2022-02-20 18:48:47,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:47,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825176876] [2022-02-20 18:48:47,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:47,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {38080#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33277~0 := 0;~__return_33467~0 := 0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {38082#(<= (+ ~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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#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__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~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__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {38082#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:47,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {38082#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {38083#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:48:47,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {38083#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {38083#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:48:47,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {38083#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {38084#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive1~0 % 256); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive2~0 % 256); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~id2~0); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive3~0 % 256); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~id3~0); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256); {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == ~alive4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {38084#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:48:47,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {38084#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {38081#false} is VALID [2022-02-20 18:48:47,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {38081#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); {38081#false} is VALID [2022-02-20 18:48:47,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {38081#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {38081#false} assume !!(0 == ~mode5~0 % 256); {38081#false} is VALID [2022-02-20 18:48:47,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {38081#false} assume !!(0 == ~alive5~0 % 256); {38081#false} is VALID [2022-02-20 18:48:47,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {38081#false} assume !(~send5~0 != ~id5~0); {38081#false} is VALID [2022-02-20 18:48:47,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {38081#false} ~mode5~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {38081#false} is VALID [2022-02-20 18:48:47,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {38081#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {38081#false} is VALID [2022-02-20 18:48:47,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {38081#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_33277~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33277~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; {38081#false} is VALID [2022-02-20 18:48:47,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {38081#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {38081#false} assume !(0 == ~mode1~0 % 256); {38081#false} is VALID [2022-02-20 18:48:47,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {38081#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {38081#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {38081#false} is VALID [2022-02-20 18:48:47,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {38081#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {38081#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {38081#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {38081#false} is VALID [2022-02-20 18:48:47,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {38081#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {38081#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {38081#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {38081#false} is VALID [2022-02-20 18:48:47,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {38081#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {38081#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {38081#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {38081#false} is VALID [2022-02-20 18:48:47,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {38081#false} ~mode4~0 := 0; {38081#false} is VALID [2022-02-20 18:48:47,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {38081#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {38081#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38081#false} is VALID [2022-02-20 18:48:47,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {38081#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {38081#false} is VALID [2022-02-20 18:48:47,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {38081#false} ~mode5~0 := 0; {38081#false} is VALID [2022-02-20 18:48:47,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {38081#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {38081#false} is VALID [2022-02-20 18:48:47,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {38081#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {38081#false} is VALID [2022-02-20 18:48:47,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {38081#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {38081#false} is VALID [2022-02-20 18:48:47,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {38081#false} ~__return_33467~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33467~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; {38081#false} is VALID [2022-02-20 18:48:47,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {38081#false} assume 0 == main_~assert__arg~1#1 % 256; {38081#false} is VALID [2022-02-20 18:48:47,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {38081#false} assume !false; {38081#false} is VALID [2022-02-20 18:48:47,842 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:48:47,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:47,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825176876] [2022-02-20 18:48:47,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825176876] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:47,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:47,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:47,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813285583] [2022-02-20 18:48:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:47,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:48:47,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:47,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:47,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:47,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:47,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:47,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:47,888 INFO L87 Difference]: Start difference. First operand 3452 states and 5387 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:01,383 INFO L93 Difference]: Finished difference Result 9853 states and 15454 transitions. [2022-02-20 18:49:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:49:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2022-02-20 18:49:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2022-02-20 18:49:01,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 649 transitions. [2022-02-20 18:49:01,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:03,592 INFO L225 Difference]: With dead ends: 9853 [2022-02-20 18:49:03,593 INFO L226 Difference]: Without dead ends: 6508 [2022-02-20 18:49:03,598 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:49:03,603 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1067 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:03,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 287 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2022-02-20 18:49:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2022-02-20 18:49:12,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:12,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6508 states. Second operand has 6506 states, 6505 states have (on average 1.5600307455803228) internal successors, (10148), 6505 states have internal predecessors, (10148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:12,797 INFO L74 IsIncluded]: Start isIncluded. First operand 6508 states. Second operand has 6506 states, 6505 states have (on average 1.5600307455803228) internal successors, (10148), 6505 states have internal predecessors, (10148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:12,803 INFO L87 Difference]: Start difference. First operand 6508 states. Second operand has 6506 states, 6505 states have (on average 1.5600307455803228) internal successors, (10148), 6505 states have internal predecessors, (10148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:14,047 INFO L93 Difference]: Finished difference Result 6508 states and 10149 transitions. [2022-02-20 18:49:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 10149 transitions. [2022-02-20 18:49:14,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:14,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:14,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 6506 states, 6505 states have (on average 1.5600307455803228) internal successors, (10148), 6505 states have internal predecessors, (10148), 0 states have call successors, (0), 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 6508 states. [2022-02-20 18:49:14,067 INFO L87 Difference]: Start difference. First operand has 6506 states, 6505 states have (on average 1.5600307455803228) internal successors, (10148), 6505 states have internal predecessors, (10148), 0 states have call successors, (0), 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 6508 states. [2022-02-20 18:49:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:15,330 INFO L93 Difference]: Finished difference Result 6508 states and 10149 transitions. [2022-02-20 18:49:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 10149 transitions. [2022-02-20 18:49:15,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:15,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:15,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:15,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6506 states, 6505 states have (on average 1.5600307455803228) internal successors, (10148), 6505 states have internal predecessors, (10148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10148 transitions. [2022-02-20 18:49:17,038 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10148 transitions. Word has length 81 [2022-02-20 18:49:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:17,038 INFO L470 AbstractCegarLoop]: Abstraction has 6506 states and 10148 transitions. [2022-02-20 18:49:17,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10148 transitions. [2022-02-20 18:49:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:49:17,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:17,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:49:17,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:49:17,040 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2100922190, now seen corresponding path program 1 times [2022-02-20 18:49:17,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:17,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512462088] [2022-02-20 18:49:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:17,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {73636#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33277~0 := 0;~__return_33467~0 := 0; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {73638#(<= (+ ~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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#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__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~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__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {73638#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {73638#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {73638#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {73638#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {73638#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {73638#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {73638#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:17,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {73638#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {73639#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:49:17,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {73639#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {73639#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:49:17,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {73639#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {73640#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {73640#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {73640#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {73637#false} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {73637#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); {73637#false} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {73637#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {73637#false} assume !!(0 == ~mode3~0 % 256); {73637#false} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {73637#false} assume !!(0 == ~alive3~0 % 256); {73637#false} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {73637#false} assume !(~send3~0 != ~id3~0); {73637#false} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {73637#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {73637#false} assume !!(0 == ~mode4~0 % 256); {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {73637#false} assume !!(0 == ~alive4~0 % 256); {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 49: Hoare triple {73637#false} assume !(~send4~0 != ~id4~0); {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {73637#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {73637#false} assume !!(0 == ~mode5~0 % 256); {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {73637#false} assume !!(0 == ~alive5~0 % 256); {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {73637#false} assume !(~send5~0 != ~id5~0); {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {73637#false} ~mode5~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {73637#false} is VALID [2022-02-20 18:49:17,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {73637#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {73637#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_33277~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33277~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; {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {73637#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {73637#false} assume !(0 == ~mode1~0 % 256); {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {73637#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {73637#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {73637#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {73637#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {73637#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {73637#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {73637#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {73637#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {73637#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {73637#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {73637#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 70: Hoare triple {73637#false} ~mode4~0 := 0; {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 71: Hoare triple {73637#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {73637#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {73637#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 74: Hoare triple {73637#false} ~mode5~0 := 0; {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 75: Hoare triple {73637#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 76: Hoare triple {73637#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 77: Hoare triple {73637#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 78: Hoare triple {73637#false} ~__return_33467~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33467~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; {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 79: Hoare triple {73637#false} assume 0 == main_~assert__arg~1#1 % 256; {73637#false} is VALID [2022-02-20 18:49:17,119 INFO L290 TraceCheckUtils]: 80: Hoare triple {73637#false} assume !false; {73637#false} is VALID [2022-02-20 18:49:17,120 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:49:17,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:17,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512462088] [2022-02-20 18:49:17,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512462088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:17,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:17,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:17,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835905501] [2022-02-20 18:49:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:17,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:49:17,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:17,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:17,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:17,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:17,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:17,168 INFO L87 Difference]: Start difference. First operand 6506 states and 10148 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)