./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.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.4.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 e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:26,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:26,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:26,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:26,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:26,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:26,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:26,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:26,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:26,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:26,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:26,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:26,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:26,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:26,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:26,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:26,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:26,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:26,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:26,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:26,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:26,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:26,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:26,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:26,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:26,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:26,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:26,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:26,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:26,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:26,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:26,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:26,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:26,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:26,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:26,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:26,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:26,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:26,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:26,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:26,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:26,129 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:52:26,156 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:26,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:26,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:26,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:26,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:26,157 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:26,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:26,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:26,158 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:26,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:26,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:26,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:26,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:26,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:26,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:26,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:26,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:26,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:26,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:26,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:26,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:26,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:26,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:26,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:26,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:26,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:26,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:26,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:26,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:26,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:26,162 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:26,162 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:26,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:26,162 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 -> e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 [2022-02-20 18:52:26,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:26,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:26,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:26,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:26,398 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:26,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:52:26,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749861da6/5a96207c92ac4a40bef0f97d4774b325/FLAG4619a0cbb [2022-02-20 18:52:26,803 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:26,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:52:26,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749861da6/5a96207c92ac4a40bef0f97d4774b325/FLAG4619a0cbb [2022-02-20 18:52:27,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749861da6/5a96207c92ac4a40bef0f97d4774b325 [2022-02-20 18:52:27,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:27,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:27,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:27,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:27,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:27,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54993bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27, skipping insertion in model container [2022-02-20 18:52:27,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:27,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:27,390 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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2022-02-20 18:52:27,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:27,432 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:27,476 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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2022-02-20 18:52:27,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:27,536 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:27,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27 WrapperNode [2022-02-20 18:52:27,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:27,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:27,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:27,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:27,550 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:52:27" (1/1) ... [2022-02-20 18:52:27,564 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:52:27" (1/1) ... [2022-02-20 18:52:27,604 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 514 [2022-02-20 18:52:27,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:27,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:27,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:27,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:27,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:27,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:27,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:27,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:27,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (1/1) ... [2022-02-20 18:52:27,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:27,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:27,671 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:52:27,673 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:52:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:27,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:27,776 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:27,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:28,294 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:28,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:28,302 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:28,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:28 BoogieIcfgContainer [2022-02-20 18:52:28,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:28,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:28,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:28,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:28,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:27" (1/3) ... [2022-02-20 18:52:28,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e439bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:28, skipping insertion in model container [2022-02-20 18:52:28,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:27" (2/3) ... [2022-02-20 18:52:28,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e439bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:28, skipping insertion in model container [2022-02-20 18:52:28,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:28" (3/3) ... [2022-02-20 18:52:28,310 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:52:28,316 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:28,317 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:52:28,345 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:28,349 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:52:28,349 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:52:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:52:28,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:28,370 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] [2022-02-20 18:52:28,370 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1503533793, now seen corresponding path program 1 times [2022-02-20 18:52:28,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:28,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960414966] [2022-02-20 18:52:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:28,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {126#true} is VALID [2022-02-20 18:52:28,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {126#true} is VALID [2022-02-20 18:52:28,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} assume 0 == ~r1~0 % 256; {126#true} is VALID [2022-02-20 18:52:28,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#true} assume ~id1~0 >= 0; {126#true} is VALID [2022-02-20 18:52:28,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#true} assume 0 == ~st1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:28,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:28,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:28,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(<= ~st1~0 0)} assume ~id2~0 >= 0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:28,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~st2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {131#(<= (+ ~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,794 INFO L290 TraceCheckUtils]: 55: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~check__tmp~1#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:28,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {127#false} is VALID [2022-02-20 18:52:28,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {127#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {127#false} is VALID [2022-02-20 18:52:28,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {127#false} assume 0 == main_~assert__arg~1#1 % 256; {127#false} is VALID [2022-02-20 18:52:28,796 INFO L290 TraceCheckUtils]: 60: Hoare triple {127#false} assume !false; {127#false} is VALID [2022-02-20 18:52:28,798 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:52:28,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:28,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960414966] [2022-02-20 18:52:28,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960414966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:28,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:28,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:28,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141737739] [2022-02-20 18:52:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:28,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:28,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:28,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:28,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:28,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:28,886 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,110 INFO L93 Difference]: Finished difference Result 588 states and 943 transitions. [2022-02-20 18:52:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:52:30,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 943 transitions. [2022-02-20 18:52:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 943 transitions. [2022-02-20 18:52:30,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 943 transitions. [2022-02-20 18:52:30,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:30,826 INFO L225 Difference]: With dead ends: 588 [2022-02-20 18:52:30,827 INFO L226 Difference]: Without dead ends: 518 [2022-02-20 18:52:30,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:30,831 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1055 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:30,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 1117 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-02-20 18:52:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 186. [2022-02-20 18:52:30,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:30,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 518 states. Second operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,922 INFO L74 IsIncluded]: Start isIncluded. First operand 518 states. Second operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,923 INFO L87 Difference]: Start difference. First operand 518 states. Second operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,939 INFO L93 Difference]: Finished difference Result 518 states and 784 transitions. [2022-02-20 18:52:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 784 transitions. [2022-02-20 18:52:30,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:30,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:30,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 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 518 states. [2022-02-20 18:52:30,942 INFO L87 Difference]: Start difference. First operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 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 518 states. [2022-02-20 18:52:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,958 INFO L93 Difference]: Finished difference Result 518 states and 784 transitions. [2022-02-20 18:52:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 784 transitions. [2022-02-20 18:52:30,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:30,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:30,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:30,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 270 transitions. [2022-02-20 18:52:30,965 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 270 transitions. Word has length 61 [2022-02-20 18:52:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:30,965 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 270 transitions. [2022-02-20 18:52:30,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 270 transitions. [2022-02-20 18:52:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:30,967 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:30,967 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] [2022-02-20 18:52:30,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:30,968 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -886934908, now seen corresponding path program 1 times [2022-02-20 18:52:30,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:30,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317244594] [2022-02-20 18:52:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:31,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {2211#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {2211#true} is VALID [2022-02-20 18:52:31,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2211#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {2211#true} is VALID [2022-02-20 18:52:31,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {2211#true} assume 0 == ~r1~0 % 256; {2211#true} is VALID [2022-02-20 18:52:31,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {2211#true} assume ~id1~0 >= 0; {2211#true} is VALID [2022-02-20 18:52:31,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {2211#true} assume 0 == ~st1~0; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:31,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:31,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:31,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {2213#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:31,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {2213#(<= ~st1~0 0)} assume 0 == ~st2~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {2215#(<= (+ ~st4~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; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:31,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:31,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:31,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:31,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:31,123 INFO L290 TraceCheckUtils]: 57: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~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; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:31,123 INFO L290 TraceCheckUtils]: 58: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} havoc main_~check__tmp~1#1; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:31,124 INFO L290 TraceCheckUtils]: 59: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {2212#false} is VALID [2022-02-20 18:52:31,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {2212#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {2212#false} is VALID [2022-02-20 18:52:31,124 INFO L290 TraceCheckUtils]: 61: Hoare triple {2212#false} assume 0 == main_~assert__arg~1#1 % 256; {2212#false} is VALID [2022-02-20 18:52:31,124 INFO L290 TraceCheckUtils]: 62: Hoare triple {2212#false} assume !false; {2212#false} is VALID [2022-02-20 18:52:31,125 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:52:31,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:31,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317244594] [2022-02-20 18:52:31,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317244594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:31,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:31,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:31,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034723102] [2022-02-20 18:52:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:31,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:31,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:31,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:31,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:31,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:31,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:31,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:31,171 INFO L87 Difference]: Start difference. First operand 186 states and 270 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:32,082 INFO L93 Difference]: Finished difference Result 664 states and 1021 transitions. [2022-02-20 18:52:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:32,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:52:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:52:32,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 626 transitions. [2022-02-20 18:52:32,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:32,489 INFO L225 Difference]: With dead ends: 664 [2022-02-20 18:52:32,489 INFO L226 Difference]: Without dead ends: 562 [2022-02-20 18:52:32,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:32,491 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 606 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:32,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 838 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-02-20 18:52:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 292. [2022-02-20 18:52:32,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:32,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 562 states. Second operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,628 INFO L74 IsIncluded]: Start isIncluded. First operand 562 states. Second operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,628 INFO L87 Difference]: Start difference. First operand 562 states. Second operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:32,643 INFO L93 Difference]: Finished difference Result 562 states and 859 transitions. [2022-02-20 18:52:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 859 transitions. [2022-02-20 18:52:32,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:32,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:32,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 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 562 states. [2022-02-20 18:52:32,645 INFO L87 Difference]: Start difference. First operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 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 562 states. [2022-02-20 18:52:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:32,658 INFO L93 Difference]: Finished difference Result 562 states and 859 transitions. [2022-02-20 18:52:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 859 transitions. [2022-02-20 18:52:32,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:32,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:32,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:32,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 438 transitions. [2022-02-20 18:52:32,666 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 438 transitions. Word has length 63 [2022-02-20 18:52:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:32,666 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 438 transitions. [2022-02-20 18:52:32,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 438 transitions. [2022-02-20 18:52:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:32,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:32,667 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] [2022-02-20 18:52:32,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:32,668 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 497894544, now seen corresponding path program 1 times [2022-02-20 18:52:32,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:32,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337048431] [2022-02-20 18:52:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:32,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {4638#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {4638#true} is VALID [2022-02-20 18:52:32,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {4638#true} is VALID [2022-02-20 18:52:32,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume 0 == ~r1~0 % 256; {4638#true} is VALID [2022-02-20 18:52:32,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {4638#true} assume ~id1~0 >= 0; {4638#true} is VALID [2022-02-20 18:52:32,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {4638#true} assume 0 == ~st1~0; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:32,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {4640#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:32,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {4640#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:32,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {4640#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:32,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {4640#(<= ~st1~0 0)} assume 0 == ~st2~0; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {4642#(<= (+ ~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; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {4642#(<= (+ ~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; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {4642#(<= (+ ~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; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {4642#(<= (+ ~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; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,785 INFO L290 TraceCheckUtils]: 55: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:32,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:32,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~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; {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:32,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} havoc main_~check__tmp~1#1; {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:32,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {4639#false} is VALID [2022-02-20 18:52:32,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {4639#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {4639#false} is VALID [2022-02-20 18:52:32,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {4639#false} assume 0 == main_~assert__arg~1#1 % 256; {4639#false} is VALID [2022-02-20 18:52:32,787 INFO L290 TraceCheckUtils]: 62: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-02-20 18:52:32,788 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:52:32,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:32,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337048431] [2022-02-20 18:52:32,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337048431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:32,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:32,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:32,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096077913] [2022-02-20 18:52:32,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:32,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:32,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:32,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:32,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:32,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:32,827 INFO L87 Difference]: Start difference. First operand 292 states and 438 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:33,735 INFO L93 Difference]: Finished difference Result 765 states and 1181 transitions. [2022-02-20 18:52:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:52:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:52:33,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 626 transitions. [2022-02-20 18:52:34,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:34,142 INFO L225 Difference]: With dead ends: 765 [2022-02-20 18:52:34,143 INFO L226 Difference]: Without dead ends: 663 [2022-02-20 18:52:34,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:34,148 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 687 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:34,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [687 Valid, 748 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-02-20 18:52:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 443. [2022-02-20 18:52:34,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:34,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 663 states. Second operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,404 INFO L74 IsIncluded]: Start isIncluded. First operand 663 states. Second operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,405 INFO L87 Difference]: Start difference. First operand 663 states. Second operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,422 INFO L93 Difference]: Finished difference Result 663 states and 1019 transitions. [2022-02-20 18:52:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1019 transitions. [2022-02-20 18:52:34,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:34,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:34,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:52:34,424 INFO L87 Difference]: Start difference. First operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:52:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,441 INFO L93 Difference]: Finished difference Result 663 states and 1019 transitions. [2022-02-20 18:52:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1019 transitions. [2022-02-20 18:52:34,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:34,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:34,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:34,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 677 transitions. [2022-02-20 18:52:34,454 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 677 transitions. Word has length 63 [2022-02-20 18:52:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:34,454 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 677 transitions. [2022-02-20 18:52:34,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 677 transitions. [2022-02-20 18:52:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:34,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:34,455 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] [2022-02-20 18:52:34,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:34,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1329115962, now seen corresponding path program 1 times [2022-02-20 18:52:34,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:34,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104720365] [2022-02-20 18:52:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:34,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {7621#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {7621#true} is VALID [2022-02-20 18:52:34,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {7621#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {7621#true} is VALID [2022-02-20 18:52:34,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {7621#true} assume 0 == ~r1~0 % 256; {7621#true} is VALID [2022-02-20 18:52:34,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {7621#true} assume ~id1~0 >= 0; {7621#true} is VALID [2022-02-20 18:52:34,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {7621#true} assume 0 == ~st1~0; {7621#true} is VALID [2022-02-20 18:52:34,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {7621#true} assume ~send1~0 == ~id1~0; {7621#true} is VALID [2022-02-20 18:52:34,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {7621#true} assume 0 == ~mode1~0 % 256; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {7621#true} assume ~id2~0 >= 0; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {7621#true} assume 0 == ~st2~0; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {7621#true} assume ~send2~0 == ~id2~0; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {7621#true} assume 0 == ~mode2~0 % 256; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {7621#true} assume ~id3~0 >= 0; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {7621#true} assume 0 == ~st3~0; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {7621#true} assume ~send3~0 == ~id3~0; {7621#true} is VALID [2022-02-20 18:52:34,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {7621#true} assume 0 == ~mode3~0 % 256; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {7621#true} assume ~id4~0 >= 0; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {7621#true} assume 0 == ~st4~0; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {7621#true} assume ~send4~0 == ~id4~0; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {7621#true} assume 0 == ~mode4~0 % 256; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {7621#true} assume ~id1~0 != ~id2~0; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {7621#true} assume ~id1~0 != ~id3~0; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {7621#true} assume ~id1~0 != ~id4~0; {7621#true} is VALID [2022-02-20 18:52:34,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {7621#true} assume ~id2~0 != ~id3~0; {7621#true} is VALID [2022-02-20 18:52:34,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {7621#true} assume ~id2~0 != ~id4~0; {7621#true} is VALID [2022-02-20 18:52:34,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {7621#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {7621#true} is VALID [2022-02-20 18:52:34,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {7621#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {7621#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:52:34,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {7621#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7621#true} is VALID [2022-02-20 18:52:34,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {7621#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {7621#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:52:34,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {7621#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {7621#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {7621#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {7621#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {7621#true} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {7621#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {7621#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {7621#true} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7621#true} is VALID [2022-02-20 18:52:34,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {7621#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7621#true} is VALID [2022-02-20 18:52:34,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {7621#true} assume !(~r1~0 % 256 >= 4); {7621#true} is VALID [2022-02-20 18:52:34,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {7621#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {7621#true} is VALID [2022-02-20 18:52:34,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {7621#true} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {7621#true} is VALID [2022-02-20 18:52:34,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {7621#true} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {7621#true} assume !(0 == ~mode1~0 % 256); {7621#true} is VALID [2022-02-20 18:52:34,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {7621#true} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {7621#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:52:34,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {7621#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {7621#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {7621#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:52:34,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {7621#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {7621#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {7621#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:52:34,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {7621#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {7621#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:52:34,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {7621#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:52:34,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {7621#true} ~mode4~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; {7621#true} is VALID [2022-02-20 18:52:34,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {7621#true} havoc main_~check__tmp~1#1; {7621#true} is VALID [2022-02-20 18:52:34,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {7621#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7621#true} is VALID [2022-02-20 18:52:34,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {7621#true} assume ~r1~0 % 256 >= 4; {7623#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 3)))} is VALID [2022-02-20 18:52:34,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {7623#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 3)))} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {7622#false} is VALID [2022-02-20 18:52:34,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {7622#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {7622#false} is VALID [2022-02-20 18:52:34,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {7622#false} assume 0 == main_~assert__arg~1#1 % 256; {7622#false} is VALID [2022-02-20 18:52:34,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {7622#false} assume !false; {7622#false} is VALID [2022-02-20 18:52:34,525 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:52:34,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:34,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104720365] [2022-02-20 18:52:34,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104720365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:34,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:34,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:34,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555992911] [2022-02-20 18:52:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:34,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:34,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:34,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:34,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:34,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:34,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:34,558 INFO L87 Difference]: Start difference. First operand 443 states and 677 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,352 INFO L93 Difference]: Finished difference Result 1102 states and 1714 transitions. [2022-02-20 18:52:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:35,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:52:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:52:35,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 319 transitions. [2022-02-20 18:52:35,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,549 INFO L225 Difference]: With dead ends: 1102 [2022-02-20 18:52:35,549 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 18:52:35,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:35,551 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 68 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:35,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 380 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 18:52:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 734. [2022-02-20 18:52:36,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:36,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,079 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,080 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,099 INFO L93 Difference]: Finished difference Result 750 states and 1142 transitions. [2022-02-20 18:52:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1142 transitions. [2022-02-20 18:52:36,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:52:36,103 INFO L87 Difference]: Start difference. First operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:52:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,122 INFO L93 Difference]: Finished difference Result 750 states and 1142 transitions. [2022-02-20 18:52:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1142 transitions. [2022-02-20 18:52:36,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:36,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1120 transitions. [2022-02-20 18:52:36,149 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1120 transitions. Word has length 63 [2022-02-20 18:52:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:36,149 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1120 transitions. [2022-02-20 18:52:36,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1120 transitions. [2022-02-20 18:52:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:36,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:36,151 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] [2022-02-20 18:52:36,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:36,151 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1501695225, now seen corresponding path program 1 times [2022-02-20 18:52:36,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:36,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899930965] [2022-02-20 18:52:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:36,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:36,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {11665#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {11665#true} is VALID [2022-02-20 18:52:36,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {11665#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {11665#true} is VALID [2022-02-20 18:52:36,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {11665#true} assume 0 == ~r1~0 % 256; {11665#true} is VALID [2022-02-20 18:52:36,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {11665#true} assume ~id1~0 >= 0; {11665#true} is VALID [2022-02-20 18:52:36,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {11665#true} assume 0 == ~st1~0; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:36,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:36,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:36,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:36,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:36,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:36,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:36,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:36,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:36,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:36,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:36,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:36,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode1~0 % 256); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,363 INFO L290 TraceCheckUtils]: 55: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode4~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; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,363 INFO L290 TraceCheckUtils]: 56: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~check__tmp~1#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:36,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {11666#false} is VALID [2022-02-20 18:52:36,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {11666#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {11666#false} is VALID [2022-02-20 18:52:36,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {11666#false} assume 0 == main_~assert__arg~1#1 % 256; {11666#false} is VALID [2022-02-20 18:52:36,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {11666#false} assume !false; {11666#false} is VALID [2022-02-20 18:52:36,366 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:52:36,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:36,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899930965] [2022-02-20 18:52:36,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899930965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:36,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:36,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:36,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417727029] [2022-02-20 18:52:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:36,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:36,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:36,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:36,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:36,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:36,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:36,411 INFO L87 Difference]: Start difference. First operand 734 states and 1120 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:37,580 INFO L93 Difference]: Finished difference Result 1379 states and 2122 transitions. [2022-02-20 18:52:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:37,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 352 transitions. [2022-02-20 18:52:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 352 transitions. [2022-02-20 18:52:37,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 352 transitions. [2022-02-20 18:52:37,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:37,820 INFO L225 Difference]: With dead ends: 1379 [2022-02-20 18:52:37,820 INFO L226 Difference]: Without dead ends: 736 [2022-02-20 18:52:37,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:37,823 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 525 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:37,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 526 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-02-20 18:52:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2022-02-20 18:52:38,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:38,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 736 states. Second operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,346 INFO L74 IsIncluded]: Start isIncluded. First operand 736 states. Second operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,347 INFO L87 Difference]: Start difference. First operand 736 states. Second operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:38,365 INFO L93 Difference]: Finished difference Result 736 states and 1117 transitions. [2022-02-20 18:52:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1117 transitions. [2022-02-20 18:52:38,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:38,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:38,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 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 736 states. [2022-02-20 18:52:38,369 INFO L87 Difference]: Start difference. First operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 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 736 states. [2022-02-20 18:52:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:38,387 INFO L93 Difference]: Finished difference Result 736 states and 1117 transitions. [2022-02-20 18:52:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1117 transitions. [2022-02-20 18:52:38,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:38,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:38,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:38,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1116 transitions. [2022-02-20 18:52:38,418 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1116 transitions. Word has length 63 [2022-02-20 18:52:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:38,418 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1116 transitions. [2022-02-20 18:52:38,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1116 transitions. [2022-02-20 18:52:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:38,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:38,419 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] [2022-02-20 18:52:38,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:38,419 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:38,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1505725276, now seen corresponding path program 1 times [2022-02-20 18:52:38,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:38,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929366747] [2022-02-20 18:52:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:38,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {16081#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {16081#true} is VALID [2022-02-20 18:52:38,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {16081#true} is VALID [2022-02-20 18:52:38,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume 0 == ~r1~0 % 256; {16081#true} is VALID [2022-02-20 18:52:38,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {16081#true} assume ~id1~0 >= 0; {16081#true} is VALID [2022-02-20 18:52:38,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {16081#true} assume 0 == ~st1~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {16083#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {16083#(<= ~st1~0 0)} assume ~id2~0 >= 0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~st2~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {16083#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {16083#(<= ~st1~0 0)} assume ~id3~0 >= 0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:38,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~st3~0; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {16085#(<= (+ ~st4~0 ~st3~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; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:38,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode4~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; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} havoc main_~check__tmp~1#1; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:38,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {16082#false} is VALID [2022-02-20 18:52:38,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {16082#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {16082#false} is VALID [2022-02-20 18:52:38,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {16082#false} assume 0 == main_~assert__arg~1#1 % 256; {16082#false} is VALID [2022-02-20 18:52:38,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-02-20 18:52:38,499 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:52:38,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:38,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929366747] [2022-02-20 18:52:38,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929366747] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:38,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:38,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:38,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764798012] [2022-02-20 18:52:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:38,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:38,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:38,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:38,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:38,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:38,539 INFO L87 Difference]: Start difference. First operand 734 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:40,272 INFO L93 Difference]: Finished difference Result 1494 states and 2292 transitions. [2022-02-20 18:52:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:40,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 625 transitions. [2022-02-20 18:52:40,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:40,714 INFO L225 Difference]: With dead ends: 1494 [2022-02-20 18:52:40,715 INFO L226 Difference]: Without dead ends: 1309 [2022-02-20 18:52:40,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:40,716 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 656 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:40,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 984 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2022-02-20 18:52:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 928. [2022-02-20 18:52:41,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:41,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1309 states. Second operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,516 INFO L74 IsIncluded]: Start isIncluded. First operand 1309 states. Second operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,517 INFO L87 Difference]: Start difference. First operand 1309 states. Second operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:41,565 INFO L93 Difference]: Finished difference Result 1309 states and 2003 transitions. [2022-02-20 18:52:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2003 transitions. [2022-02-20 18:52:41,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:41,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:41,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 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 1309 states. [2022-02-20 18:52:41,569 INFO L87 Difference]: Start difference. First operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 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 1309 states. [2022-02-20 18:52:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:41,617 INFO L93 Difference]: Finished difference Result 1309 states and 2003 transitions. [2022-02-20 18:52:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2003 transitions. [2022-02-20 18:52:41,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:41,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:41,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:41,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1417 transitions. [2022-02-20 18:52:41,657 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1417 transitions. Word has length 63 [2022-02-20 18:52:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:41,658 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 1417 transitions. [2022-02-20 18:52:41,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1417 transitions. [2022-02-20 18:52:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:41,658 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:41,658 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] [2022-02-20 18:52:41,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:41,659 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:41,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1830608528, now seen corresponding path program 1 times [2022-02-20 18:52:41,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:41,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928092894] [2022-02-20 18:52:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:41,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {22076#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {22076#true} is VALID [2022-02-20 18:52:41,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {22076#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {22076#true} is VALID [2022-02-20 18:52:41,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {22076#true} assume 0 == ~r1~0 % 256; {22076#true} is VALID [2022-02-20 18:52:41,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {22076#true} assume ~id1~0 >= 0; {22076#true} is VALID [2022-02-20 18:52:41,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {22076#true} assume 0 == ~st1~0; {22076#true} is VALID [2022-02-20 18:52:41,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {22076#true} assume ~send1~0 == ~id1~0; {22076#true} is VALID [2022-02-20 18:52:41,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {22076#true} assume 0 == ~mode1~0 % 256; {22076#true} is VALID [2022-02-20 18:52:41,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {22076#true} assume ~id2~0 >= 0; {22076#true} is VALID [2022-02-20 18:52:41,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {22076#true} assume 0 == ~st2~0; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:41,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {22078#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:41,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {22078#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:41,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {22078#(<= ~st2~0 0)} assume ~id3~0 >= 0; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:41,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {22078#(<= ~st2~0 0)} assume 0 == ~st3~0; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 4); {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:41,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~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; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} havoc main_~check__tmp~1#1; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:41,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {22077#false} is VALID [2022-02-20 18:52:41,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {22077#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {22077#false} is VALID [2022-02-20 18:52:41,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {22077#false} assume 0 == main_~assert__arg~1#1 % 256; {22077#false} is VALID [2022-02-20 18:52:41,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {22077#false} assume !false; {22077#false} is VALID [2022-02-20 18:52:41,754 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:52:41,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:41,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928092894] [2022-02-20 18:52:41,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928092894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:41,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:41,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:41,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612302373] [2022-02-20 18:52:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:41,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:41,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:41,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:41,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:41,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:41,790 INFO L87 Difference]: Start difference. First operand 928 states and 1417 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:43,908 INFO L93 Difference]: Finished difference Result 1688 states and 2593 transitions. [2022-02-20 18:52:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:43,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:43,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 625 transitions. [2022-02-20 18:52:44,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:44,340 INFO L225 Difference]: With dead ends: 1688 [2022-02-20 18:52:44,340 INFO L226 Difference]: Without dead ends: 1503 [2022-02-20 18:52:44,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:44,341 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 663 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:44,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 763 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-02-20 18:52:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1122. [2022-02-20 18:52:45,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:45,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1503 states. Second operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,541 INFO L74 IsIncluded]: Start isIncluded. First operand 1503 states. Second operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,542 INFO L87 Difference]: Start difference. First operand 1503 states. Second operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:45,606 INFO L93 Difference]: Finished difference Result 1503 states and 2304 transitions. [2022-02-20 18:52:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2304 transitions. [2022-02-20 18:52:45,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:45,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:45,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 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 1503 states. [2022-02-20 18:52:45,610 INFO L87 Difference]: Start difference. First operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 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 1503 states. [2022-02-20 18:52:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:45,674 INFO L93 Difference]: Finished difference Result 1503 states and 2304 transitions. [2022-02-20 18:52:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2304 transitions. [2022-02-20 18:52:45,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:45,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:45,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:45,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1718 transitions. [2022-02-20 18:52:45,729 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1718 transitions. Word has length 63 [2022-02-20 18:52:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:45,730 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1718 transitions. [2022-02-20 18:52:45,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1718 transitions. [2022-02-20 18:52:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:45,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:45,731 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] [2022-02-20 18:52:45,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:45,731 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1584928427, now seen corresponding path program 1 times [2022-02-20 18:52:45,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:45,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967016358] [2022-02-20 18:52:45,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:45,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {29003#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {29005#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:45,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {29005#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {29005#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:45,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {29005#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {29005#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:45,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {29005#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {29006#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:45,800 INFO L290 TraceCheckUtils]: 4: Hoare triple {29006#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {29006#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:45,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {29006#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:45,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {29004#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {29004#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {29004#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {29004#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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {29004#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {29004#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {29004#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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {29004#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {29004#false} is VALID [2022-02-20 18:52:45,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {29004#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {29004#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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {29004#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {29004#false} assume !(~r1~0 % 256 >= 4); {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {29004#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {29004#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {29004#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {29004#false} assume !(0 == ~mode1~0 % 256); {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {29004#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {29004#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:45,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {29004#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {29004#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {29004#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {29004#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {29004#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {29004#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {29004#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {29004#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {29004#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {29004#false} ~mode4~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; {29004#false} is VALID [2022-02-20 18:52:45,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {29004#false} havoc main_~check__tmp~1#1; {29004#false} is VALID [2022-02-20 18:52:45,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {29004#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {29004#false} is VALID [2022-02-20 18:52:45,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {29004#false} assume ~r1~0 % 256 >= 4; {29004#false} is VALID [2022-02-20 18:52:45,809 INFO L290 TraceCheckUtils]: 59: Hoare triple {29004#false} assume !(~r1~0 % 256 < 4); {29004#false} is VALID [2022-02-20 18:52:45,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {29004#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {29004#false} is VALID [2022-02-20 18:52:45,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {29004#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {29004#false} is VALID [2022-02-20 18:52:45,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {29004#false} assume 0 == main_~assert__arg~1#1 % 256; {29004#false} is VALID [2022-02-20 18:52:45,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {29004#false} assume !false; {29004#false} is VALID [2022-02-20 18:52:45,809 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:52:45,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:45,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967016358] [2022-02-20 18:52:45,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967016358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:45,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:45,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:45,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844583955] [2022-02-20 18:52:45,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:45,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:45,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:45,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:45,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:45,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:45,850 INFO L87 Difference]: Start difference. First operand 1122 states and 1718 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,952 INFO L93 Difference]: Finished difference Result 2215 states and 3406 transitions. [2022-02-20 18:52:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2022-02-20 18:52:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2022-02-20 18:52:47,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 302 transitions. [2022-02-20 18:52:48,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:48,178 INFO L225 Difference]: With dead ends: 2215 [2022-02-20 18:52:48,178 INFO L226 Difference]: Without dead ends: 1122 [2022-02-20 18:52:48,179 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:52:48,180 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 451 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:48,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 91 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-02-20 18:52:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-02-20 18:52:49,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:49,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.512042818911686) internal successors, (1695), 1121 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,920 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.512042818911686) internal successors, (1695), 1121 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,921 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.512042818911686) internal successors, (1695), 1121 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:49,957 INFO L93 Difference]: Finished difference Result 1122 states and 1695 transitions. [2022-02-20 18:52:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1695 transitions. [2022-02-20 18:52:49,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:49,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:49,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 1122 states, 1121 states have (on average 1.512042818911686) internal successors, (1695), 1121 states have internal predecessors, (1695), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:52:49,961 INFO L87 Difference]: Start difference. First operand has 1122 states, 1121 states have (on average 1.512042818911686) internal successors, (1695), 1121 states have internal predecessors, (1695), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:52:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:50,015 INFO L93 Difference]: Finished difference Result 1122 states and 1695 transitions. [2022-02-20 18:52:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1695 transitions. [2022-02-20 18:52:50,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:50,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:50,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:50,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.512042818911686) internal successors, (1695), 1121 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1695 transitions. [2022-02-20 18:52:50,067 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1695 transitions. Word has length 64 [2022-02-20 18:52:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:50,069 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1695 transitions. [2022-02-20 18:52:50,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1695 transitions. [2022-02-20 18:52:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:50,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:50,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:50,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:50,070 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash -747879712, now seen corresponding path program 1 times [2022-02-20 18:52:50,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:50,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95562351] [2022-02-20 18:52:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:50,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {35897#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {35899#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {35899#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:50,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {35899#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {35900#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:50,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {35900#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {35900#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:50,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {35900#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35901#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:50,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {35901#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {35898#false} is VALID [2022-02-20 18:52:50,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {35898#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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {35898#false} is VALID [2022-02-20 18:52:50,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {35898#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {35898#false} is VALID [2022-02-20 18:52:50,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {35898#false} assume !(~r1~0 % 256 >= 4); {35898#false} is VALID [2022-02-20 18:52:50,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {35898#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {35898#false} is VALID [2022-02-20 18:52:50,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {35898#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {35898#false} is VALID [2022-02-20 18:52:50,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {35898#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {35898#false} assume !(0 == ~mode1~0 % 256); {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {35898#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {35898#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {35898#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {35898#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {35898#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {35898#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {35898#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {35898#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {35898#false} is VALID [2022-02-20 18:52:50,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {35898#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {35898#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {35898#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {35898#false} ~mode4~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; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {35898#false} havoc main_~check__tmp~1#1; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {35898#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 59: Hoare triple {35898#false} assume ~r1~0 % 256 >= 4; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {35898#false} assume !(~r1~0 % 256 < 4); {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {35898#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {35898#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {35898#false} is VALID [2022-02-20 18:52:50,131 INFO L290 TraceCheckUtils]: 63: Hoare triple {35898#false} assume 0 == main_~assert__arg~1#1 % 256; {35898#false} is VALID [2022-02-20 18:52:50,132 INFO L290 TraceCheckUtils]: 64: Hoare triple {35898#false} assume !false; {35898#false} is VALID [2022-02-20 18:52:50,132 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:52:50,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:50,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95562351] [2022-02-20 18:52:50,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95562351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:50,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:50,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:50,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058849582] [2022-02-20 18:52:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:50,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:50,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:50,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:50,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:50,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:50,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:50,168 INFO L87 Difference]: Start difference. First operand 1122 states and 1695 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,653 INFO L93 Difference]: Finished difference Result 2203 states and 3346 transitions. [2022-02-20 18:52:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:52,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 284 transitions. [2022-02-20 18:52:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 284 transitions. [2022-02-20 18:52:52,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 284 transitions. [2022-02-20 18:52:52,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:52,874 INFO L225 Difference]: With dead ends: 2203 [2022-02-20 18:52:52,874 INFO L226 Difference]: Without dead ends: 1122 [2022-02-20 18:52:52,883 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:52:52,886 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 411 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:52,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 115 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-02-20 18:52:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-02-20 18:52:54,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:54,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.4915254237288136) internal successors, (1672), 1121 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,965 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.4915254237288136) internal successors, (1672), 1121 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,966 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.4915254237288136) internal successors, (1672), 1121 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:55,004 INFO L93 Difference]: Finished difference Result 1122 states and 1672 transitions. [2022-02-20 18:52:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1672 transitions. [2022-02-20 18:52:55,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:55,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:55,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 1122 states, 1121 states have (on average 1.4915254237288136) internal successors, (1672), 1121 states have internal predecessors, (1672), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:52:55,007 INFO L87 Difference]: Start difference. First operand has 1122 states, 1121 states have (on average 1.4915254237288136) internal successors, (1672), 1121 states have internal predecessors, (1672), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:52:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:55,044 INFO L93 Difference]: Finished difference Result 1122 states and 1672 transitions. [2022-02-20 18:52:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1672 transitions. [2022-02-20 18:52:55,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:55,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:55,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:55,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4915254237288136) internal successors, (1672), 1121 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1672 transitions. [2022-02-20 18:52:55,096 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1672 transitions. Word has length 65 [2022-02-20 18:52:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:55,097 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1672 transitions. [2022-02-20 18:52:55,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1672 transitions. [2022-02-20 18:52:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:55,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:55,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:55,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:55,098 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:55,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash 431205441, now seen corresponding path program 1 times [2022-02-20 18:52:55,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:55,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419797677] [2022-02-20 18:52:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:55,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {42776#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {42778#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:55,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {42778#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {42778#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:55,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {42778#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {42778#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:55,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {42778#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {42778#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:55,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {42778#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {42778#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:55,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {42778#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {42778#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:55,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {42778#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {42778#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:55,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {42778#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {42779#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:55,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {42779#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {42779#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:55,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {42779#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {42780#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:55,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {42780#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {42777#false} is VALID [2022-02-20 18:52:55,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {42777#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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {42777#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {42777#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {42777#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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {42777#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {42777#false} assume ~send4~0 != ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {42777#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {42777#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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {42777#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {42777#false} assume !(~r1~0 % 256 >= 4); {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {42777#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {42777#false} is VALID [2022-02-20 18:52:55,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {42777#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {42777#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {42777#false} assume !(0 == ~mode1~0 % 256); {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {42777#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {42777#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {42777#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {42777#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {42777#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {42777#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {42777#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {42777#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {42777#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {42777#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {42777#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {42777#false} ~mode4~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; {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {42777#false} havoc main_~check__tmp~1#1; {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {42777#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {42777#false} assume ~r1~0 % 256 >= 4; {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {42777#false} assume !(~r1~0 % 256 < 4); {42777#false} is VALID [2022-02-20 18:52:55,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {42777#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {42777#false} is VALID [2022-02-20 18:52:55,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {42777#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {42777#false} is VALID [2022-02-20 18:52:55,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {42777#false} assume 0 == main_~assert__arg~1#1 % 256; {42777#false} is VALID [2022-02-20 18:52:55,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {42777#false} assume !false; {42777#false} is VALID [2022-02-20 18:52:55,157 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:52:55,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:55,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419797677] [2022-02-20 18:52:55,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419797677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:55,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:55,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:55,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542360622] [2022-02-20 18:52:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:52:55,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:55,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:55,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:55,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:55,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:55,193 INFO L87 Difference]: Start difference. First operand 1122 states and 1672 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:57,960 INFO L93 Difference]: Finished difference Result 2211 states and 3310 transitions. [2022-02-20 18:52:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:57,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:52:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2022-02-20 18:52:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2022-02-20 18:52:57,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 290 transitions. [2022-02-20 18:52:58,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,185 INFO L225 Difference]: With dead ends: 2211 [2022-02-20 18:52:58,185 INFO L226 Difference]: Without dead ends: 1122 [2022-02-20 18:52:58,186 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:52:58,187 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 427 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:58,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 99 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-02-20 18:53:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-02-20 18:53:00,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:00,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.471008028545941) internal successors, (1649), 1121 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,554 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.471008028545941) internal successors, (1649), 1121 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,555 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.471008028545941) internal successors, (1649), 1121 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:00,592 INFO L93 Difference]: Finished difference Result 1122 states and 1649 transitions. [2022-02-20 18:53:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1649 transitions. [2022-02-20 18:53:00,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:00,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:00,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 1122 states, 1121 states have (on average 1.471008028545941) internal successors, (1649), 1121 states have internal predecessors, (1649), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:53:00,595 INFO L87 Difference]: Start difference. First operand has 1122 states, 1121 states have (on average 1.471008028545941) internal successors, (1649), 1121 states have internal predecessors, (1649), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:53:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:00,633 INFO L93 Difference]: Finished difference Result 1122 states and 1649 transitions. [2022-02-20 18:53:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1649 transitions. [2022-02-20 18:53:00,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:00,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:00,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:00,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.471008028545941) internal successors, (1649), 1121 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1649 transitions. [2022-02-20 18:53:00,686 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1649 transitions. Word has length 66 [2022-02-20 18:53:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:00,686 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1649 transitions. [2022-02-20 18:53:00,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1649 transitions. [2022-02-20 18:53:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:53:00,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:00,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:00,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:53:00,687 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:00,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1430381312, now seen corresponding path program 1 times [2022-02-20 18:53:00,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:00,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136692557] [2022-02-20 18:53:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:00,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {49665#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {49667#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {49667#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:00,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {49667#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {49668#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:53:00,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {49668#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {49668#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:53:00,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {49668#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {49669#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:53:00,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {49669#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {49666#false} is VALID [2022-02-20 18:53:00,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {49666#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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {49666#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {49666#false} is VALID [2022-02-20 18:53:00,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {49666#false} assume ~send4~0 != ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {49666#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {49666#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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {49666#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {49666#false} assume !(~r1~0 % 256 >= 4); {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {49666#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {49666#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {49666#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {49666#false} assume !(0 == ~mode1~0 % 256); {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {49666#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {49666#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {49666#false} is VALID [2022-02-20 18:53:00,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {49666#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {49666#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {49666#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {49666#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {49666#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {49666#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {49666#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {49666#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {49666#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {49666#false} ~mode4~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; {49666#false} is VALID [2022-02-20 18:53:00,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {49666#false} havoc main_~check__tmp~1#1; {49666#false} is VALID [2022-02-20 18:53:00,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {49666#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {49666#false} is VALID [2022-02-20 18:53:00,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {49666#false} assume ~r1~0 % 256 >= 4; {49666#false} is VALID [2022-02-20 18:53:00,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {49666#false} assume !(~r1~0 % 256 < 4); {49666#false} is VALID [2022-02-20 18:53:00,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {49666#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {49666#false} is VALID [2022-02-20 18:53:00,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {49666#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {49666#false} is VALID [2022-02-20 18:53:00,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {49666#false} assume 0 == main_~assert__arg~1#1 % 256; {49666#false} is VALID [2022-02-20 18:53:00,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {49666#false} assume !false; {49666#false} is VALID [2022-02-20 18:53:00,744 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:53:00,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:00,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136692557] [2022-02-20 18:53:00,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136692557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:00,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:00,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:53:00,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995379494] [2022-02-20 18:53:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:00,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:53:00,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:00,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:00,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:53:00,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:53:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:53:00,781 INFO L87 Difference]: Start difference. First operand 1122 states and 1649 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:03,847 INFO L93 Difference]: Finished difference Result 2207 states and 3260 transitions. [2022-02-20 18:53:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:53:03,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:53:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 282 transitions. [2022-02-20 18:53:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 282 transitions. [2022-02-20 18:53:03,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 282 transitions. [2022-02-20 18:53:04,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:04,069 INFO L225 Difference]: With dead ends: 2207 [2022-02-20 18:53:04,069 INFO L226 Difference]: Without dead ends: 1122 [2022-02-20 18:53:04,070 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:53:04,070 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 409 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:04,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 107 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-02-20 18:53:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-02-20 18:53:06,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:06,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.4504906333630687) internal successors, (1626), 1121 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,737 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.4504906333630687) internal successors, (1626), 1121 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,738 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 1122 states, 1121 states have (on average 1.4504906333630687) internal successors, (1626), 1121 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:06,775 INFO L93 Difference]: Finished difference Result 1122 states and 1626 transitions. [2022-02-20 18:53:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2022-02-20 18:53:06,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:06,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:06,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 1122 states, 1121 states have (on average 1.4504906333630687) internal successors, (1626), 1121 states have internal predecessors, (1626), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:53:06,778 INFO L87 Difference]: Start difference. First operand has 1122 states, 1121 states have (on average 1.4504906333630687) internal successors, (1626), 1121 states have internal predecessors, (1626), 0 states have call successors, (0), 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 1122 states. [2022-02-20 18:53:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:06,815 INFO L93 Difference]: Finished difference Result 1122 states and 1626 transitions. [2022-02-20 18:53:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2022-02-20 18:53:06,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:06,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:06,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:06,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4504906333630687) internal successors, (1626), 1121 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1626 transitions. [2022-02-20 18:53:06,868 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1626 transitions. Word has length 67 [2022-02-20 18:53:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:06,868 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1626 transitions. [2022-02-20 18:53:06,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1626 transitions. [2022-02-20 18:53:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:53:06,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:06,869 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] [2022-02-20 18:53:06,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:53:06,869 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:06,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash -654863315, now seen corresponding path program 1 times [2022-02-20 18:53:06,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:06,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047561069] [2022-02-20 18:53:06,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:06,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:07,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {56549#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {56551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:07,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {56551#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {56552#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {56552#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {56552#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {56552#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {56553#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {56553#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {56553#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {56553#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:07,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {56554#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {56555#(and (<= (+ ~nomsg~0 1) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 127) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|))} is VALID [2022-02-20 18:53:07,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {56555#(and (<= (+ ~nomsg~0 1) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 127) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send2~0 != ~nomsg~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send3~0 != ~nomsg~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send4~0 != ~nomsg~0; {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:53:07,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {56556#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {56557#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|)))) (or (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|))) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} is VALID [2022-02-20 18:53:07,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {56557#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|)))) (or (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|))) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:53:07,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:53:07,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(~r1~0 % 256 >= 4); {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:53:07,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:53:07,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:53:07,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:53:07,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == ~mode1~0 % 256); {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:53:07,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {56558#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {56559#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} is VALID [2022-02-20 18:53:07,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {56559#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {56560#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:07,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {56560#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {56560#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:07,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {56560#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {56561#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:53:07,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {56561#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {56550#false} is VALID [2022-02-20 18:53:07,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {56550#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {56550#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {56550#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {56550#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {56550#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {56550#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 59: Hoare triple {56550#false} ~mode4~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; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {56550#false} havoc main_~check__tmp~1#1; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {56550#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {56550#false} assume ~r1~0 % 256 >= 4; {56550#false} is VALID [2022-02-20 18:53:07,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {56550#false} assume !(~r1~0 % 256 < 4); {56550#false} is VALID [2022-02-20 18:53:07,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {56550#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {56550#false} is VALID [2022-02-20 18:53:07,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {56550#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {56550#false} is VALID [2022-02-20 18:53:07,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {56550#false} assume 0 == main_~assert__arg~1#1 % 256; {56550#false} is VALID [2022-02-20 18:53:07,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {56550#false} assume !false; {56550#false} is VALID [2022-02-20 18:53:07,156 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:53:07,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:07,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047561069] [2022-02-20 18:53:07,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047561069] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:07,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:07,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:53:07,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057207381] [2022-02-20 18:53:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:07,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:53:07,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:07,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:07,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:53:07,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:53:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:53:07,203 INFO L87 Difference]: Start difference. First operand 1122 states and 1626 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:16,302 INFO L93 Difference]: Finished difference Result 3259 states and 4738 transitions. [2022-02-20 18:53:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:53:16,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:53:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 358 transitions. [2022-02-20 18:53:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 358 transitions. [2022-02-20 18:53:16,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 358 transitions. [2022-02-20 18:53:16,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:16,725 INFO L225 Difference]: With dead ends: 3259 [2022-02-20 18:53:16,726 INFO L226 Difference]: Without dead ends: 2215 [2022-02-20 18:53:16,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:53:16,727 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 879 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:16,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 468 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:53:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2022-02-20 18:53:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1122. [2022-02-20 18:53:20,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:20,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2215 states. Second operand has 1122 states, 1121 states have (on average 1.4487065120428189) internal successors, (1624), 1121 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,372 INFO L74 IsIncluded]: Start isIncluded. First operand 2215 states. Second operand has 1122 states, 1121 states have (on average 1.4487065120428189) internal successors, (1624), 1121 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,373 INFO L87 Difference]: Start difference. First operand 2215 states. Second operand has 1122 states, 1121 states have (on average 1.4487065120428189) internal successors, (1624), 1121 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:20,513 INFO L93 Difference]: Finished difference Result 2215 states and 3205 transitions. [2022-02-20 18:53:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3205 transitions. [2022-02-20 18:53:20,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:20,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:20,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 1122 states, 1121 states have (on average 1.4487065120428189) internal successors, (1624), 1121 states have internal predecessors, (1624), 0 states have call successors, (0), 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 2215 states. [2022-02-20 18:53:20,517 INFO L87 Difference]: Start difference. First operand has 1122 states, 1121 states have (on average 1.4487065120428189) internal successors, (1624), 1121 states have internal predecessors, (1624), 0 states have call successors, (0), 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 2215 states. [2022-02-20 18:53:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:20,663 INFO L93 Difference]: Finished difference Result 2215 states and 3205 transitions. [2022-02-20 18:53:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3205 transitions. [2022-02-20 18:53:20,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:20,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:20,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:20,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4487065120428189) internal successors, (1624), 1121 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1624 transitions. [2022-02-20 18:53:20,719 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1624 transitions. Word has length 68 [2022-02-20 18:53:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:20,719 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1624 transitions. [2022-02-20 18:53:20,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1624 transitions. [2022-02-20 18:53:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:53:20,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:20,720 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] [2022-02-20 18:53:20,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:53:20,721 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 302063151, now seen corresponding path program 1 times [2022-02-20 18:53:20,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:20,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362968466] [2022-02-20 18:53:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:20,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {67160#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(48, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2895~0 := 0;~__return_2986~0 := 0;~__return_3148~0 := 0; {67162#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:20,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {67162#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#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_~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_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {67163#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {67164#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {67164#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {67164#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:20,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {67164#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:20,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {67165#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {67166#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:53:20,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {67166#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:53:20,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:53:20,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~send3~0 != ~nomsg~0; {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:53:20,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:53:20,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} ~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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:53:20,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:53:20,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~send4~0 != ~nomsg~0; {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:53:20,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {67167#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {67168#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) ~p2_new~0))) (or (not (= (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} is VALID [2022-02-20 18:53:20,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {67168#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) ~p2_new~0))) (or (not (= (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} ~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);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:53:20,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:53:20,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} assume !(~r1~0 % 256 >= 4); {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:53:20,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:53:20,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2986~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2986~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; {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:53:20,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:53:20,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} assume !(0 == ~mode1~0 % 256); {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:53:20,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {67169#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p4_old~0 ~p2_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {67170#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} is VALID [2022-02-20 18:53:20,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {67170#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {67171#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {67171#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {67171#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {67171#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {67171#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {67171#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {67171#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {67171#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {67171#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {67171#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {67171#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {67171#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {67172#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:53:20,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {67172#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {67161#false} is VALID [2022-02-20 18:53:20,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {67161#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {67161#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {67161#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {67161#false} ~mode4~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; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {67161#false} havoc main_~check__tmp~1#1; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {67161#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {67161#false} assume ~r1~0 % 256 >= 4; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 64: Hoare triple {67161#false} assume !(~r1~0 % 256 < 4); {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {67161#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {67161#false} ~__return_3148~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3148~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; {67161#false} is VALID [2022-02-20 18:53:20,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {67161#false} assume 0 == main_~assert__arg~1#1 % 256; {67161#false} is VALID [2022-02-20 18:53:20,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {67161#false} assume !false; {67161#false} is VALID [2022-02-20 18:53:20,965 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:53:20,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:20,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362968466] [2022-02-20 18:53:20,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362968466] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:20,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:20,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:53:20,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523792716] [2022-02-20 18:53:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:53:20,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:20,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:21,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:21,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:53:21,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:53:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:53:21,011 INFO L87 Difference]: Start difference. First operand 1122 states and 1624 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)