./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.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.5.ufo.BOUNDED-10.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 eb34721bf39b8c345e8997284756581f81ddbf5d57990eeac4742dbd2546fd8d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:53:37,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:53:37,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:53:37,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:53:37,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:53:37,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:53:37,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:53:37,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:53:37,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:53:37,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:53:37,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:53:37,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:53:37,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:53:37,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:53:37,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:53:37,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:53:37,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:53:37,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:53:37,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:53:37,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:53:37,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:53:37,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:53:37,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:53:37,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:53:37,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:53:37,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:53:37,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:53:37,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:53:37,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:53:37,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:53:37,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:53:37,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:53:37,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:53:37,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:53:37,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:53:37,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:53:37,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:53:37,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:53:37,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:53:37,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:53:37,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:53:37,597 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:53:37,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:53:37,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:53:37,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:53:37,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:53:37,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:53:37,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:53:37,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:53:37,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:53:37,618 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:53:37,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:53:37,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:53:37,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:53:37,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:53:37,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:53:37,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:53:37,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:53:37,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:53:37,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:53:37,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:53:37,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:53:37,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:53:37,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:53:37,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:53:37,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:53:37,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:37,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:53:37,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:53:37,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:53:37,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:53:37,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:53:37,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:53:37,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:53:37,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:53:37,622 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 -> eb34721bf39b8c345e8997284756581f81ddbf5d57990eeac4742dbd2546fd8d [2022-02-20 18:53:37,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:53:37,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:53:37,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:53:37,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:53:37,842 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:53:37,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:53:37,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951b72c13/cd76e4bb246c4af99504915a9ff1e304/FLAGdeada6d2d [2022-02-20 18:53:38,258 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:53:38,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:53:38,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951b72c13/cd76e4bb246c4af99504915a9ff1e304/FLAGdeada6d2d [2022-02-20 18:53:38,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951b72c13/cd76e4bb246c4af99504915a9ff1e304 [2022-02-20 18:53:38,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:53:38,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:53:38,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:38,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:53:38,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:53:38,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36818691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38, skipping insertion in model container [2022-02-20 18:53:38,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:53:38,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:53:38,500 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.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7979,7992] [2022-02-20 18:53:38,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:38,562 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:53:38,593 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.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7979,7992] [2022-02-20 18:53:38,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:38,638 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:53:38,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38 WrapperNode [2022-02-20 18:53:38,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:38,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:38,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:53:38,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:53:38,651 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:53:38" (1/1) ... [2022-02-20 18:53:38,659 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:53:38" (1/1) ... [2022-02-20 18:53:38,692 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 629 [2022-02-20 18:53:38,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:38,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:53:38,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:53:38,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:53:38,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:53:38,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:53:38,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:53:38,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:53:38,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (1/1) ... [2022-02-20 18:53:38,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:38,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:53:38,776 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:53:38,778 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:53:38,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:53:38,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:53:38,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:53:38,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:53:38,871 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:53:38,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:53:39,424 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:53:39,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:53:39,434 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:53:39,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:39 BoogieIcfgContainer [2022-02-20 18:53:39,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:53:39,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:53:39,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:53:39,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:53:39,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:53:38" (1/3) ... [2022-02-20 18:53:39,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37052941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:39, skipping insertion in model container [2022-02-20 18:53:39,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:38" (2/3) ... [2022-02-20 18:53:39,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37052941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:39, skipping insertion in model container [2022-02-20 18:53:39,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:39" (3/3) ... [2022-02-20 18:53:39,444 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:53:39,448 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:53:39,449 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:53:39,478 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:53:39,482 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:53:39,482 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:53:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:53:39,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:39,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:39,503 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:39,507 INFO L85 PathProgramCache]: Analyzing trace with hash -95572409, now seen corresponding path program 1 times [2022-02-20 18:53:39,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:39,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183745486] [2022-02-20 18:53:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:39,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:39,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {153#true} is VALID [2022-02-20 18:53:39,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {153#true} is VALID [2022-02-20 18:53:39,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#true} assume 0 == ~r1~0; {153#true} is VALID [2022-02-20 18:53:39,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#true} assume ~id1~0 >= 0; {153#true} is VALID [2022-02-20 18:53:39,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#true} assume 0 == ~st1~0; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:39,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:39,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {155#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:39,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(<= ~st1~0 0)} assume ~id2~0 >= 0; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:39,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(<= ~st1~0 0)} assume 0 == ~st2~0; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#(<= (+ ~st5~0 ~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; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#(<= (+ ~st5~0 ~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; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#(<= (+ ~st5~0 ~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; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#(<= (+ ~st5~0 ~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,949 INFO L290 TraceCheckUtils]: 58: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,949 INFO L290 TraceCheckUtils]: 59: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,951 INFO L290 TraceCheckUtils]: 62: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,955 INFO L290 TraceCheckUtils]: 67: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,956 INFO L290 TraceCheckUtils]: 70: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:39,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {154#false} is VALID [2022-02-20 18:53:39,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {154#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {154#false} is VALID [2022-02-20 18:53:39,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {154#false} assume 0 == main_~assert__arg~1#1 % 256; {154#false} is VALID [2022-02-20 18:53:39,958 INFO L290 TraceCheckUtils]: 75: Hoare triple {154#false} assume !false; {154#false} is VALID [2022-02-20 18:53:39,961 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:39,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:39,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183745486] [2022-02-20 18:53:39,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183745486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:39,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:39,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:39,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8209181] [2022-02-20 18:53:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:53:39,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:39,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:40,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:40,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:40,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:40,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:40,064 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:41,994 INFO L93 Difference]: Finished difference Result 845 states and 1355 transitions. [2022-02-20 18:53:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:53:41,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:53:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1355 transitions. [2022-02-20 18:53:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1355 transitions. [2022-02-20 18:53:42,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1355 transitions. [2022-02-20 18:53:42,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1355 edges. 1355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:42,961 INFO L225 Difference]: With dead ends: 845 [2022-02-20 18:53:42,961 INFO L226 Difference]: Without dead ends: 751 [2022-02-20 18:53:42,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:53:42,966 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 1636 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:42,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1636 Valid, 1886 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-02-20 18:53:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 227. [2022-02-20 18:53:43,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:43,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call 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:43,067 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call 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:43,067 INFO L87 Difference]: Start difference. First operand 751 states. Second operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call 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:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:43,093 INFO L93 Difference]: Finished difference Result 751 states and 1141 transitions. [2022-02-20 18:53:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1141 transitions. [2022-02-20 18:53:43,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:43,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:43,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 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 751 states. [2022-02-20 18:53:43,097 INFO L87 Difference]: Start difference. First operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 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 751 states. [2022-02-20 18:53:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:43,123 INFO L93 Difference]: Finished difference Result 751 states and 1141 transitions. [2022-02-20 18:53:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1141 transitions. [2022-02-20 18:53:43,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:43,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:43,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:43,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call 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:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2022-02-20 18:53:43,131 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 76 [2022-02-20 18:53:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:43,131 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2022-02-20 18:53:43,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2022-02-20 18:53:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:43,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:43,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:43,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:53:43,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:43,134 INFO L85 PathProgramCache]: Analyzing trace with hash -136563640, now seen corresponding path program 1 times [2022-02-20 18:53:43,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:43,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834075012] [2022-02-20 18:53:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:43,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {3101#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {3101#true} is VALID [2022-02-20 18:53:43,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {3101#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {3101#true} is VALID [2022-02-20 18:53:43,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {3101#true} assume 0 == ~r1~0; {3101#true} is VALID [2022-02-20 18:53:43,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {3101#true} assume ~id1~0 >= 0; {3101#true} is VALID [2022-02-20 18:53:43,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {3101#true} assume 0 == ~st1~0; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:43,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {3103#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:43,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {3103#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:43,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:43,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {3103#(<= ~st1~0 0)} assume 0 == ~st2~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {3106#(<= (+ ~st5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {3106#(<= (+ ~st5~0 ~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; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {3106#(<= (+ ~st5~0 ~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; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {3106#(<= (+ ~st5~0 ~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; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {3106#(<= (+ ~st5~0 ~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {3106#(<= (+ ~st5~0 ~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; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {3106#(<= (+ ~st5~0 ~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; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:43,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,287 INFO L290 TraceCheckUtils]: 67: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~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; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,288 INFO L290 TraceCheckUtils]: 68: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,289 INFO L290 TraceCheckUtils]: 70: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,289 INFO L290 TraceCheckUtils]: 71: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,290 INFO L290 TraceCheckUtils]: 73: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:43,290 INFO L290 TraceCheckUtils]: 74: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {3102#false} is VALID [2022-02-20 18:53:43,290 INFO L290 TraceCheckUtils]: 75: Hoare triple {3102#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {3102#false} is VALID [2022-02-20 18:53:43,291 INFO L290 TraceCheckUtils]: 76: Hoare triple {3102#false} assume 0 == main_~assert__arg~1#1 % 256; {3102#false} is VALID [2022-02-20 18:53:43,291 INFO L290 TraceCheckUtils]: 77: Hoare triple {3102#false} assume !false; {3102#false} is VALID [2022-02-20 18:53:43,291 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:43,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:43,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834075012] [2022-02-20 18:53:43,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834075012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:43,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:43,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:43,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103923187] [2022-02-20 18:53:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:43,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:43,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:43,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:43,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:43,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:43,341 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:44,784 INFO L93 Difference]: Finished difference Result 922 states and 1419 transitions. [2022-02-20 18:53:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:44,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:53:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:53:44,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 861 transitions. [2022-02-20 18:53:45,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 861 edges. 861 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:45,373 INFO L225 Difference]: With dead ends: 922 [2022-02-20 18:53:45,373 INFO L226 Difference]: Without dead ends: 802 [2022-02-20 18:53:45,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:45,375 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 1026 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:45,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 1146 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-02-20 18:53:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 356. [2022-02-20 18:53:45,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:45,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 802 states. Second operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call 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:45,614 INFO L74 IsIncluded]: Start isIncluded. First operand 802 states. Second operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call 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:45,615 INFO L87 Difference]: Start difference. First operand 802 states. Second operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call 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:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:45,640 INFO L93 Difference]: Finished difference Result 802 states and 1229 transitions. [2022-02-20 18:53:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1229 transitions. [2022-02-20 18:53:45,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:45,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:45,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 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 802 states. [2022-02-20 18:53:45,642 INFO L87 Difference]: Start difference. First operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 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 802 states. [2022-02-20 18:53:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:45,683 INFO L93 Difference]: Finished difference Result 802 states and 1229 transitions. [2022-02-20 18:53:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1229 transitions. [2022-02-20 18:53:45,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:45,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:45,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:45,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call 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:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2022-02-20 18:53:45,693 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 78 [2022-02-20 18:53:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:45,694 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2022-02-20 18:53:45,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2022-02-20 18:53:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:45,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:45,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:45,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:53:45,696 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1646592496, now seen corresponding path program 1 times [2022-02-20 18:53:45,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:45,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457459618] [2022-02-20 18:53:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:45,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {6435#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {6435#true} is VALID [2022-02-20 18:53:45,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {6435#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {6435#true} is VALID [2022-02-20 18:53:45,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {6435#true} assume 0 == ~r1~0; {6435#true} is VALID [2022-02-20 18:53:45,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {6435#true} assume ~id1~0 >= 0; {6435#true} is VALID [2022-02-20 18:53:45,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {6435#true} assume 0 == ~st1~0; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:45,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {6437#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:45,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {6437#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:45,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {6437#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:45,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {6437#(<= ~st1~0 0)} assume 0 == ~st2~0; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {6440#(<= (+ ~st5~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {6440#(<= (+ ~st5~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {6440#(<= (+ ~st5~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {6440#(<= (+ ~st5~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,828 INFO L290 TraceCheckUtils]: 50: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {6440#(<= (+ ~st5~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,835 INFO L290 TraceCheckUtils]: 60: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {6440#(<= (+ ~st5~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {6440#(<= (+ ~st5~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:45,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:45,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:45,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:45,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:45,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:45,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:45,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {6436#false} is VALID [2022-02-20 18:53:45,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {6436#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {6436#false} is VALID [2022-02-20 18:53:45,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {6436#false} assume 0 == main_~assert__arg~1#1 % 256; {6436#false} is VALID [2022-02-20 18:53:45,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {6436#false} assume !false; {6436#false} is VALID [2022-02-20 18:53:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:45,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:45,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457459618] [2022-02-20 18:53:45,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457459618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:45,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:45,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:45,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264082219] [2022-02-20 18:53:45,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:45,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:45,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:45,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:45,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:45,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:45,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:45,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:45,889 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:47,455 INFO L93 Difference]: Finished difference Result 1046 states and 1615 transitions. [2022-02-20 18:53:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:53:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:53:47,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 861 transitions. [2022-02-20 18:53:47,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 861 edges. 861 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:47,988 INFO L225 Difference]: With dead ends: 1046 [2022-02-20 18:53:47,988 INFO L226 Difference]: Without dead ends: 926 [2022-02-20 18:53:47,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:47,989 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 1288 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:47,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1288 Valid, 1050 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-02-20 18:53:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 539. [2022-02-20 18:53:48,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:48,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 926 states. Second operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call 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:48,445 INFO L74 IsIncluded]: Start isIncluded. First operand 926 states. Second operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call 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:48,445 INFO L87 Difference]: Start difference. First operand 926 states. Second operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call 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:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:48,477 INFO L93 Difference]: Finished difference Result 926 states and 1425 transitions. [2022-02-20 18:53:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1425 transitions. [2022-02-20 18:53:48,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:48,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:48,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 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 926 states. [2022-02-20 18:53:48,481 INFO L87 Difference]: Start difference. First operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 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 926 states. [2022-02-20 18:53:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:48,514 INFO L93 Difference]: Finished difference Result 926 states and 1425 transitions. [2022-02-20 18:53:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1425 transitions. [2022-02-20 18:53:48,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:48,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:48,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:48,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call 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:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 821 transitions. [2022-02-20 18:53:48,531 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 821 transitions. Word has length 78 [2022-02-20 18:53:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:48,532 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 821 transitions. [2022-02-20 18:53:48,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 821 transitions. [2022-02-20 18:53:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:48,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:48,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:48,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:53:48,536 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash 641558373, now seen corresponding path program 1 times [2022-02-20 18:53:48,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:48,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212554477] [2022-02-20 18:53:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:48,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {10443#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {10443#true} is VALID [2022-02-20 18:53:48,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {10443#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {10443#true} is VALID [2022-02-20 18:53:48,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {10443#true} assume 0 == ~r1~0; {10443#true} is VALID [2022-02-20 18:53:48,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {10443#true} assume ~id1~0 >= 0; {10443#true} is VALID [2022-02-20 18:53:48,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {10443#true} assume 0 == ~st1~0; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:48,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:48,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:48,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:48,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:48,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:48,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:48,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:48,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:48,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,780 INFO L290 TraceCheckUtils]: 50: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 5); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,786 INFO L290 TraceCheckUtils]: 66: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,788 INFO L290 TraceCheckUtils]: 71: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,789 INFO L290 TraceCheckUtils]: 72: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,789 INFO L290 TraceCheckUtils]: 73: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 5); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:48,790 INFO L290 TraceCheckUtils]: 74: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);main_~check__tmp~1#1 := 0; {10444#false} is VALID [2022-02-20 18:53:48,790 INFO L290 TraceCheckUtils]: 75: Hoare triple {10444#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {10444#false} is VALID [2022-02-20 18:53:48,790 INFO L290 TraceCheckUtils]: 76: Hoare triple {10444#false} assume 0 == main_~assert__arg~1#1 % 256; {10444#false} is VALID [2022-02-20 18:53:48,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {10444#false} assume !false; {10444#false} is VALID [2022-02-20 18:53:48,791 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:48,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:48,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212554477] [2022-02-20 18:53:48,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212554477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:48,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:48,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:48,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131737219] [2022-02-20 18:53:48,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:48,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:48,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:48,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:48,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:48,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:48,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:48,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:48,858 INFO L87 Difference]: Start difference. First operand 539 states and 821 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:50,046 INFO L93 Difference]: Finished difference Result 956 states and 1478 transitions. [2022-02-20 18:53:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:50,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 425 transitions. [2022-02-20 18:53:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 425 transitions. [2022-02-20 18:53:50,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 425 transitions. [2022-02-20 18:53:50,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:50,328 INFO L225 Difference]: With dead ends: 956 [2022-02-20 18:53:50,328 INFO L226 Difference]: Without dead ends: 541 [2022-02-20 18:53:50,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:53:50,330 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 700 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:50,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 678 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-02-20 18:53:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2022-02-20 18:53:50,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:50,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call 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:50,783 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call 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:50,784 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call 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:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:50,795 INFO L93 Difference]: Finished difference Result 541 states and 818 transitions. [2022-02-20 18:53:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 818 transitions. [2022-02-20 18:53:50,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:50,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:50,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 541 states. [2022-02-20 18:53:50,799 INFO L87 Difference]: Start difference. First operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 541 states. [2022-02-20 18:53:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:50,811 INFO L93 Difference]: Finished difference Result 541 states and 818 transitions. [2022-02-20 18:53:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 818 transitions. [2022-02-20 18:53:50,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:50,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:50,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:50,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call 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:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 817 transitions. [2022-02-20 18:53:50,828 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 817 transitions. Word has length 78 [2022-02-20 18:53:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:50,828 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 817 transitions. [2022-02-20 18:53:50,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 817 transitions. [2022-02-20 18:53:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:50,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:50,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:50,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:53:50,830 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:50,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:50,831 INFO L85 PathProgramCache]: Analyzing trace with hash 434659878, now seen corresponding path program 1 times [2022-02-20 18:53:50,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:50,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053422068] [2022-02-20 18:53:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:50,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:50,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {13558#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {13558#true} is VALID [2022-02-20 18:53:50,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {13558#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {13558#true} is VALID [2022-02-20 18:53:50,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {13558#true} assume 0 == ~r1~0; {13558#true} is VALID [2022-02-20 18:53:50,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {13558#true} assume ~id1~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:50,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {13558#true} assume 0 == ~st1~0; {13558#true} is VALID [2022-02-20 18:53:50,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {13558#true} assume ~send1~0 == ~id1~0; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {13558#true} assume 0 == ~mode1~0 % 256; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {13558#true} assume ~id2~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {13558#true} assume 0 == ~st2~0; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {13558#true} assume ~send2~0 == ~id2~0; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {13558#true} assume 0 == ~mode2~0 % 256; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {13558#true} assume ~id3~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {13558#true} assume 0 == ~st3~0; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {13558#true} assume ~send3~0 == ~id3~0; {13558#true} is VALID [2022-02-20 18:53:50,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {13558#true} assume 0 == ~mode3~0 % 256; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {13558#true} assume ~id4~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {13558#true} assume 0 == ~st4~0; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {13558#true} assume ~send4~0 == ~id4~0; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {13558#true} assume 0 == ~mode4~0 % 256; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {13558#true} assume ~id5~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#true} assume 0 == ~st5~0; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {13558#true} assume ~send5~0 == ~id5~0; {13558#true} is VALID [2022-02-20 18:53:50,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {13558#true} assume 0 == ~mode5~0 % 256; {13558#true} is VALID [2022-02-20 18:53:50,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {13558#true} assume ~id1~0 != ~id2~0; {13558#true} is VALID [2022-02-20 18:53:50,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {13558#true} assume ~id1~0 != ~id3~0; {13558#true} is VALID [2022-02-20 18:53:50,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {13558#true} assume ~id1~0 != ~id4~0; {13558#true} is VALID [2022-02-20 18:53:50,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {13558#true} assume ~id1~0 != ~id5~0; {13558#true} is VALID [2022-02-20 18:53:50,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {13558#true} assume ~id2~0 != ~id3~0; {13558#true} is VALID [2022-02-20 18:53:50,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {13558#true} assume ~id2~0 != ~id4~0; {13558#true} is VALID [2022-02-20 18:53:50,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {13558#true} assume ~id2~0 != ~id5~0; {13558#true} is VALID [2022-02-20 18:53:50,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {13558#true} assume ~id3~0 != ~id4~0; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {13558#true} assume ~id3~0 != ~id5~0; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {13558#true} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {13558#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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {13558#true} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {13558#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {13558#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {13558#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; {13558#true} is VALID [2022-02-20 18:53:50,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {13558#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {13558#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {13558#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; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {13558#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {13558#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {13558#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; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {13558#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {13558#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13558#true} is VALID [2022-02-20 18:53:50,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {13558#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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {13558#true} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {13558#true} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {13558#true} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 50: Hoare triple {13558#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {13558#true} assume !(~r1~0 >= 5); {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {13558#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {13558#true} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {13558#true} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {13558#true} is VALID [2022-02-20 18:53:50,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {13558#true} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {13558#true} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {13558#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:50,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {13558#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {13558#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {13558#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:50,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {13558#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {13558#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {13558#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:50,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {13558#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {13558#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {13558#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:50,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {13558#true} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {13558#true} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:50,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {13558#true} assume !(main_~node5__m5~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:50,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {13558#true} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:50,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {13558#true} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {13558#true} is VALID [2022-02-20 18:53:50,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {13558#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13558#true} is VALID [2022-02-20 18:53:50,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {13558#true} assume ~r1~0 >= 5; {13560#(not (<= ~r1~0 4))} is VALID [2022-02-20 18:53:50,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {13560#(not (<= ~r1~0 4))} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {13559#false} is VALID [2022-02-20 18:53:50,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {13559#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {13559#false} is VALID [2022-02-20 18:53:50,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {13559#false} assume 0 == main_~assert__arg~1#1 % 256; {13559#false} is VALID [2022-02-20 18:53:50,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {13559#false} assume !false; {13559#false} is VALID [2022-02-20 18:53:50,908 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:50,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:50,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053422068] [2022-02-20 18:53:50,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053422068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:50,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:50,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:50,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796815591] [2022-02-20 18:53:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:50,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:50,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:50,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:50,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:50,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:50,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:50,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:50,949 INFO L87 Difference]: Start difference. First operand 539 states and 817 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:52,092 INFO L93 Difference]: Finished difference Result 1324 states and 2046 transitions. [2022-02-20 18:53:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:52,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-02-20 18:53:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-02-20 18:53:52,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 383 transitions. [2022-02-20 18:53:52,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:52,344 INFO L225 Difference]: With dead ends: 1324 [2022-02-20 18:53:52,344 INFO L226 Difference]: Without dead ends: 909 [2022-02-20 18:53:52,345 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:53:52,349 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:52,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-02-20 18:53:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2022-02-20 18:53:53,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:53,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 909 states. Second operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call 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:53,134 INFO L74 IsIncluded]: Start isIncluded. First operand 909 states. Second operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call 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:53,136 INFO L87 Difference]: Start difference. First operand 909 states. Second operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call 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:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:53,164 INFO L93 Difference]: Finished difference Result 909 states and 1380 transitions. [2022-02-20 18:53:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1380 transitions. [2022-02-20 18:53:53,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:53,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:53,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 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 909 states. [2022-02-20 18:53:53,181 INFO L87 Difference]: Start difference. First operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 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 909 states. [2022-02-20 18:53:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:53,209 INFO L93 Difference]: Finished difference Result 909 states and 1380 transitions. [2022-02-20 18:53:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1380 transitions. [2022-02-20 18:53:53,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:53,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:53,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:53,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call 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:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1379 transitions. [2022-02-20 18:53:53,248 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1379 transitions. Word has length 78 [2022-02-20 18:53:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:53,248 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 1379 transitions. [2022-02-20 18:53:53,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1379 transitions. [2022-02-20 18:53:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:53,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:53,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:53,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:53:53,253 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:53,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 450386228, now seen corresponding path program 1 times [2022-02-20 18:53:53,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:53,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133257673] [2022-02-20 18:53:53,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:53,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {18437#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {18437#true} is VALID [2022-02-20 18:53:53,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {18437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {18437#true} is VALID [2022-02-20 18:53:53,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {18437#true} assume 0 == ~r1~0; {18437#true} is VALID [2022-02-20 18:53:53,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {18437#true} assume ~id1~0 >= 0; {18437#true} is VALID [2022-02-20 18:53:53,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {18437#true} assume 0 == ~st1~0; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {18439#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {18439#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {18439#(<= ~st1~0 0)} assume ~id2~0 >= 0; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {18439#(<= ~st1~0 0)} assume 0 == ~st2~0; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,358 INFO L290 TraceCheckUtils]: 46: Hoare triple {18442#(<= (+ ~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,358 INFO L290 TraceCheckUtils]: 47: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,364 INFO L290 TraceCheckUtils]: 64: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {18442#(<= (+ ~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 != ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 > ~id5~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 == ~id5~0;~st5~0 := 1; {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:53,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:53,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:53,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {18438#false} is VALID [2022-02-20 18:53:53,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {18438#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {18438#false} is VALID [2022-02-20 18:53:53,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {18438#false} assume 0 == main_~assert__arg~1#1 % 256; {18438#false} is VALID [2022-02-20 18:53:53,367 INFO L290 TraceCheckUtils]: 77: Hoare triple {18438#false} assume !false; {18438#false} is VALID [2022-02-20 18:53:53,368 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:53,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:53,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133257673] [2022-02-20 18:53:53,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133257673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:53,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:53,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:53,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29068690] [2022-02-20 18:53:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:53,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:53,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:53,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:53,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:53,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:53,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:53,416 INFO L87 Difference]: Start difference. First operand 907 states and 1379 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:55,943 INFO L93 Difference]: Finished difference Result 2058 states and 3161 transitions. [2022-02-20 18:53:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:55,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 860 transitions. [2022-02-20 18:53:56,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:56,564 INFO L225 Difference]: With dead ends: 2058 [2022-02-20 18:53:56,565 INFO L226 Difference]: Without dead ends: 1833 [2022-02-20 18:53:56,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:56,566 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 1036 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:56,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1036 Valid, 1296 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2022-02-20 18:53:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1131. [2022-02-20 18:53:57,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:57,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1833 states. Second operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call 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:57,678 INFO L74 IsIncluded]: Start isIncluded. First operand 1833 states. Second operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call 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:57,680 INFO L87 Difference]: Start difference. First operand 1833 states. Second operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call 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:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,783 INFO L93 Difference]: Finished difference Result 1833 states and 2810 transitions. [2022-02-20 18:53:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2810 transitions. [2022-02-20 18:53:57,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:57,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:57,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 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 1833 states. [2022-02-20 18:53:57,788 INFO L87 Difference]: Start difference. First operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 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 1833 states. [2022-02-20 18:53:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,892 INFO L93 Difference]: Finished difference Result 1833 states and 2810 transitions. [2022-02-20 18:53:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2810 transitions. [2022-02-20 18:53:57,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:57,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:57,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:57,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call 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:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1726 transitions. [2022-02-20 18:53:57,957 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1726 transitions. Word has length 78 [2022-02-20 18:53:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:57,957 INFO L470 AbstractCegarLoop]: Abstraction has 1131 states and 1726 transitions. [2022-02-20 18:53:57,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1726 transitions. [2022-02-20 18:53:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:57,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:57,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:57,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:53:57,958 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1926158884, now seen corresponding path program 1 times [2022-02-20 18:53:57,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:57,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210185786] [2022-02-20 18:53:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:58,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {26517#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {26517#true} is VALID [2022-02-20 18:53:58,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {26517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {26517#true} is VALID [2022-02-20 18:53:58,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {26517#true} assume 0 == ~r1~0; {26517#true} is VALID [2022-02-20 18:53:58,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {26517#true} assume ~id1~0 >= 0; {26517#true} is VALID [2022-02-20 18:53:58,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {26517#true} assume 0 == ~st1~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {26519#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {26519#(<= ~st1~0 0)} assume ~id2~0 >= 0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~st2~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {26519#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {26519#(<= ~st1~0 0)} assume ~id3~0 >= 0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~st3~0; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id5~0 >= 0; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {26522#(<= (+ ~st5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {26522#(<= (+ ~st5~0 ~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; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {26522#(<= (+ ~st5~0 ~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; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {26522#(<= (+ ~st5~0 ~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; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {26522#(<= (+ ~st5~0 ~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {26522#(<= (+ ~st5~0 ~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; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,054 INFO L290 TraceCheckUtils]: 60: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,057 INFO L290 TraceCheckUtils]: 68: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,057 INFO L290 TraceCheckUtils]: 69: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,057 INFO L290 TraceCheckUtils]: 70: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:58,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {26518#false} is VALID [2022-02-20 18:53:58,059 INFO L290 TraceCheckUtils]: 75: Hoare triple {26518#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {26518#false} is VALID [2022-02-20 18:53:58,059 INFO L290 TraceCheckUtils]: 76: Hoare triple {26518#false} assume 0 == main_~assert__arg~1#1 % 256; {26518#false} is VALID [2022-02-20 18:53:58,059 INFO L290 TraceCheckUtils]: 77: Hoare triple {26518#false} assume !false; {26518#false} is VALID [2022-02-20 18:53:58,060 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:58,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:58,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210185786] [2022-02-20 18:53:58,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210185786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:58,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:58,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:58,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461622985] [2022-02-20 18:53:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:58,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:58,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:58,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:58,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:58,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:58,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:58,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:58,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:58,104 INFO L87 Difference]: Start difference. First operand 1131 states and 1726 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:01,351 INFO L93 Difference]: Finished difference Result 2292 states and 3524 transitions. [2022-02-20 18:54:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:54:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:54:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:54:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:54:01,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 860 transitions. [2022-02-20 18:54:01,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:02,037 INFO L225 Difference]: With dead ends: 2292 [2022-02-20 18:54:02,038 INFO L226 Difference]: Without dead ends: 2067 [2022-02-20 18:54:02,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:54:02,039 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 1078 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:02,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1078 Valid, 1595 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-02-20 18:54:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1370. [2022-02-20 18:54:03,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:03,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2067 states. Second operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,630 INFO L74 IsIncluded]: Start isIncluded. First operand 2067 states. Second operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,631 INFO L87 Difference]: Start difference. First operand 2067 states. Second operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:03,759 INFO L93 Difference]: Finished difference Result 2067 states and 3173 transitions. [2022-02-20 18:54:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3173 transitions. [2022-02-20 18:54:03,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:03,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:03,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 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 2067 states. [2022-02-20 18:54:03,765 INFO L87 Difference]: Start difference. First operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 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 2067 states. [2022-02-20 18:54:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:03,890 INFO L93 Difference]: Finished difference Result 2067 states and 3173 transitions. [2022-02-20 18:54:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3173 transitions. [2022-02-20 18:54:03,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:03,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:03,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:03,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2097 transitions. [2022-02-20 18:54:03,968 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2097 transitions. Word has length 78 [2022-02-20 18:54:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:03,968 INFO L470 AbstractCegarLoop]: Abstraction has 1370 states and 2097 transitions. [2022-02-20 18:54:03,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2097 transitions. [2022-02-20 18:54:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:54:03,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:03,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:03,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:54:03,969 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 100434268, now seen corresponding path program 1 times [2022-02-20 18:54:03,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:03,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141861117] [2022-02-20 18:54:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:04,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {35723#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {35723#true} is VALID [2022-02-20 18:54:04,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {35723#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {35723#true} is VALID [2022-02-20 18:54:04,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {35723#true} assume 0 == ~r1~0; {35723#true} is VALID [2022-02-20 18:54:04,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {35723#true} assume ~id1~0 >= 0; {35723#true} is VALID [2022-02-20 18:54:04,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {35723#true} assume 0 == ~st1~0; {35723#true} is VALID [2022-02-20 18:54:04,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {35723#true} assume ~send1~0 == ~id1~0; {35723#true} is VALID [2022-02-20 18:54:04,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {35723#true} assume 0 == ~mode1~0 % 256; {35723#true} is VALID [2022-02-20 18:54:04,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {35723#true} assume ~id2~0 >= 0; {35723#true} is VALID [2022-02-20 18:54:04,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {35723#true} assume 0 == ~st2~0; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:04,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {35725#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:04,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {35725#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:04,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {35725#(<= ~st2~0 0)} assume ~id3~0 >= 0; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:04,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {35725#(<= ~st2~0 0)} assume 0 == ~st3~0; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id5~0 >= 0; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send5~0 == ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode5~0 % 256; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {35728#(<= (+ ~st5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {35728#(<= (+ ~st5~0 ~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; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {35728#(<= (+ ~st5~0 ~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; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {35728#(<= (+ ~st5~0 ~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; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {35728#(<= (+ ~st5~0 ~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 5); {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,053 INFO L290 TraceCheckUtils]: 55: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:04,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~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; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~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; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,057 INFO L290 TraceCheckUtils]: 67: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~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; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,057 INFO L290 TraceCheckUtils]: 68: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,059 INFO L290 TraceCheckUtils]: 71: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,059 INFO L290 TraceCheckUtils]: 72: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:04,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {35724#false} is VALID [2022-02-20 18:54:04,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {35724#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {35724#false} is VALID [2022-02-20 18:54:04,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {35724#false} assume 0 == main_~assert__arg~1#1 % 256; {35724#false} is VALID [2022-02-20 18:54:04,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {35724#false} assume !false; {35724#false} is VALID [2022-02-20 18:54:04,060 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:54:04,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:04,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141861117] [2022-02-20 18:54:04,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141861117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:04,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:04,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:54:04,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572366238] [2022-02-20 18:54:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:04,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:54:04,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:04,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:04,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:54:04,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:04,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:54:04,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:04,106 INFO L87 Difference]: Start difference. First operand 1370 states and 2097 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:08,254 INFO L93 Difference]: Finished difference Result 2531 states and 3895 transitions. [2022-02-20 18:54:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:54:08,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:54:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:54:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:54:08,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 860 transitions. [2022-02-20 18:54:08,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:09,014 INFO L225 Difference]: With dead ends: 2531 [2022-02-20 18:54:09,014 INFO L226 Difference]: Without dead ends: 2306 [2022-02-20 18:54:09,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:54:09,015 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1082 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:09,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1082 Valid, 1257 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-02-20 18:54:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1609. [2022-02-20 18:54:11,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:11,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2306 states. Second operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,395 INFO L74 IsIncluded]: Start isIncluded. First operand 2306 states. Second operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,396 INFO L87 Difference]: Start difference. First operand 2306 states. Second operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:11,548 INFO L93 Difference]: Finished difference Result 2306 states and 3544 transitions. [2022-02-20 18:54:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3544 transitions. [2022-02-20 18:54:11,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:11,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:11,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 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 2306 states. [2022-02-20 18:54:11,553 INFO L87 Difference]: Start difference. First operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 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 2306 states. [2022-02-20 18:54:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:11,709 INFO L93 Difference]: Finished difference Result 2306 states and 3544 transitions. [2022-02-20 18:54:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3544 transitions. [2022-02-20 18:54:11,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:11,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:11,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:11,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2468 transitions. [2022-02-20 18:54:11,831 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2468 transitions. Word has length 78 [2022-02-20 18:54:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:11,831 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 2468 transitions. [2022-02-20 18:54:11,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2468 transitions. [2022-02-20 18:54:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:54:11,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:11,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:11,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:54:11,832 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1588436194, now seen corresponding path program 1 times [2022-02-20 18:54:11,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:11,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765877361] [2022-02-20 18:54:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:11,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {46071#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {46073#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {46073#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {46073#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {46073#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {46073#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {46073#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {46074#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:54:11,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {46074#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {46074#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:54:11,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {46074#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {46075#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:11,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {46072#false} is VALID [2022-02-20 18:54:11,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {46072#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; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {46072#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {46072#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {46072#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; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {46072#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {46072#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {46072#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; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {46072#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {46072#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {46072#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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {46072#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {46072#false} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {46072#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {46072#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {46072#false} assume !(~r1~0 >= 5); {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {46072#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {46072#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {46072#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {46072#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {46072#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {46072#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {46072#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {46072#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {46072#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {46072#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {46072#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {46072#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 64: Hoare triple {46072#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 65: Hoare triple {46072#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,898 INFO L290 TraceCheckUtils]: 66: Hoare triple {46072#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 67: Hoare triple {46072#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {46072#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 69: Hoare triple {46072#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 70: Hoare triple {46072#false} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 71: Hoare triple {46072#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 72: Hoare triple {46072#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {46072#false} assume !(~r1~0 >= 5); {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 74: Hoare triple {46072#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 75: Hoare triple {46072#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {46072#false} is VALID [2022-02-20 18:54:11,899 INFO L290 TraceCheckUtils]: 76: Hoare triple {46072#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {46072#false} is VALID [2022-02-20 18:54:11,900 INFO L290 TraceCheckUtils]: 77: Hoare triple {46072#false} assume 0 == main_~assert__arg~1#1 % 256; {46072#false} is VALID [2022-02-20 18:54:11,900 INFO L290 TraceCheckUtils]: 78: Hoare triple {46072#false} assume !false; {46072#false} is VALID [2022-02-20 18:54:11,900 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:54:11,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:11,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765877361] [2022-02-20 18:54:11,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765877361] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:11,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:11,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:11,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352478899] [2022-02-20 18:54:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 18:54:11,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:11,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:11,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:11,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:11,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:11,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:11,948 INFO L87 Difference]: Start difference. First operand 1609 states and 2468 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:15,616 INFO L93 Difference]: Finished difference Result 3180 states and 4897 transitions. [2022-02-20 18:54:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 18:54:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 365 transitions. [2022-02-20 18:54:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 365 transitions. [2022-02-20 18:54:15,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 365 transitions. [2022-02-20 18:54:15,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:15,920 INFO L225 Difference]: With dead ends: 3180 [2022-02-20 18:54:15,921 INFO L226 Difference]: Without dead ends: 1609 [2022-02-20 18:54:15,922 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:54:15,922 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 550 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:15,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 110 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-02-20 18:54:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2022-02-20 18:54:18,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:18,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.5180348258706469) internal successors, (2441), 1608 states have internal predecessors, (2441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:18,939 INFO L74 IsIncluded]: Start isIncluded. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.5180348258706469) internal successors, (2441), 1608 states have internal predecessors, (2441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:18,941 INFO L87 Difference]: Start difference. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.5180348258706469) internal successors, (2441), 1608 states have internal predecessors, (2441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:19,024 INFO L93 Difference]: Finished difference Result 1609 states and 2441 transitions. [2022-02-20 18:54:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2441 transitions. [2022-02-20 18:54:19,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:19,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:19,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 1609 states, 1608 states have (on average 1.5180348258706469) internal successors, (2441), 1608 states have internal predecessors, (2441), 0 states have call successors, (0), 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 1609 states. [2022-02-20 18:54:19,029 INFO L87 Difference]: Start difference. First operand has 1609 states, 1608 states have (on average 1.5180348258706469) internal successors, (2441), 1608 states have internal predecessors, (2441), 0 states have call successors, (0), 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 1609 states. [2022-02-20 18:54:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:19,109 INFO L93 Difference]: Finished difference Result 1609 states and 2441 transitions. [2022-02-20 18:54:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2441 transitions. [2022-02-20 18:54:19,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:19,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:19,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:19,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5180348258706469) internal successors, (2441), 1608 states have internal predecessors, (2441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2441 transitions. [2022-02-20 18:54:19,241 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2441 transitions. Word has length 79 [2022-02-20 18:54:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:19,241 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 2441 transitions. [2022-02-20 18:54:19,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2441 transitions. [2022-02-20 18:54:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:54:19,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:19,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:19,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:54:19,242 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1613161725, now seen corresponding path program 1 times [2022-02-20 18:54:19,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:19,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138404892] [2022-02-20 18:54:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:19,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {55913#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {55915#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:19,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {55915#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {55916#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:54:19,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {55916#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {55916#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:54:19,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {55916#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send1~0 != ~nomsg~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~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; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~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; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~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; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {55917#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:19,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {55917#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {55914#false} is VALID [2022-02-20 18:54:19,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {55914#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {55914#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {55914#false} assume !(~r1~0 >= 5); {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {55914#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {55914#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {55914#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {55914#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {55914#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {55914#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {55914#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {55914#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {55914#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {55914#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {55914#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 64: Hoare triple {55914#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 65: Hoare triple {55914#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {55914#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {55914#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {55914#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {55914#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 70: Hoare triple {55914#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 71: Hoare triple {55914#false} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 72: Hoare triple {55914#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {55914#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {55914#false} assume !(~r1~0 >= 5); {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {55914#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 76: Hoare triple {55914#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {55914#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 78: Hoare triple {55914#false} assume 0 == main_~assert__arg~1#1 % 256; {55914#false} is VALID [2022-02-20 18:54:19,339 INFO L290 TraceCheckUtils]: 79: Hoare triple {55914#false} assume !false; {55914#false} is VALID [2022-02-20 18:54:19,340 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:54:19,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:19,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138404892] [2022-02-20 18:54:19,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138404892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:19,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:19,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:19,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401143805] [2022-02-20 18:54:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-02-20 18:54:19,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:19,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:19,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:19,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:19,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:19,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:19,393 INFO L87 Difference]: Start difference. First operand 1609 states and 2441 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:23,544 INFO L93 Difference]: Finished difference Result 3164 states and 4824 transitions. [2022-02-20 18:54:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-02-20 18:54:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-02-20 18:54:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-02-20 18:54:23,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 342 transitions. [2022-02-20 18:54:23,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:23,836 INFO L225 Difference]: With dead ends: 3164 [2022-02-20 18:54:23,836 INFO L226 Difference]: Without dead ends: 1609 [2022-02-20 18:54:23,838 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:54:23,838 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 499 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:23,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 142 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-02-20 18:54:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2022-02-20 18:54:27,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:27,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.5012437810945274) internal successors, (2414), 1608 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:27,287 INFO L74 IsIncluded]: Start isIncluded. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.5012437810945274) internal successors, (2414), 1608 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:27,288 INFO L87 Difference]: Start difference. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.5012437810945274) internal successors, (2414), 1608 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:27,366 INFO L93 Difference]: Finished difference Result 1609 states and 2414 transitions. [2022-02-20 18:54:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2414 transitions. [2022-02-20 18:54:27,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:27,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:27,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 1609 states, 1608 states have (on average 1.5012437810945274) internal successors, (2414), 1608 states have internal predecessors, (2414), 0 states have call successors, (0), 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 1609 states. [2022-02-20 18:54:27,371 INFO L87 Difference]: Start difference. First operand has 1609 states, 1608 states have (on average 1.5012437810945274) internal successors, (2414), 1608 states have internal predecessors, (2414), 0 states have call successors, (0), 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 1609 states. [2022-02-20 18:54:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:27,454 INFO L93 Difference]: Finished difference Result 1609 states and 2414 transitions. [2022-02-20 18:54:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2414 transitions. [2022-02-20 18:54:27,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:27,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:27,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:27,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5012437810945274) internal successors, (2414), 1608 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2414 transitions. [2022-02-20 18:54:27,572 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2414 transitions. Word has length 80 [2022-02-20 18:54:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:27,572 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 2414 transitions. [2022-02-20 18:54:27,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2414 transitions. [2022-02-20 18:54:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:54:27,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:27,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:27,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:54:27,573 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:27,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash -105949250, now seen corresponding path program 1 times [2022-02-20 18:54:27,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:27,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109154210] [2022-02-20 18:54:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:27,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {65735#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {65737#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:27,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {65737#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {65738#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:27,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {65738#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {65738#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:27,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {65738#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {65739#(<= (+ ~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; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {65739#(<= (+ ~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; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {65739#(<= (+ ~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; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {65739#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:27,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {65739#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {65736#false} is VALID [2022-02-20 18:54:27,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {65736#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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {65736#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {65736#false} is VALID [2022-02-20 18:54:27,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {65736#false} assume ~send5~0 != ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {65736#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {65736#false} is VALID [2022-02-20 18:54:27,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {65736#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {65736#false} is VALID [2022-02-20 18:54:27,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {65736#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {65736#false} assume !(~r1~0 >= 5); {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {65736#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {65736#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {65736#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {65736#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {65736#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 59: Hoare triple {65736#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {65736#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {65736#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {65736#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {65736#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {65736#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {65736#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {65736#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 67: Hoare triple {65736#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {65736#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {65736#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {65736#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {65736#false} is VALID [2022-02-20 18:54:27,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {65736#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {65736#false} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 73: Hoare triple {65736#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {65736#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 75: Hoare triple {65736#false} assume !(~r1~0 >= 5); {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 76: Hoare triple {65736#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 77: Hoare triple {65736#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 78: Hoare triple {65736#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {65736#false} assume 0 == main_~assert__arg~1#1 % 256; {65736#false} is VALID [2022-02-20 18:54:27,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {65736#false} assume !false; {65736#false} is VALID [2022-02-20 18:54:27,652 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:54:27,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:27,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109154210] [2022-02-20 18:54:27,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109154210] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:27,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:27,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:27,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811792797] [2022-02-20 18:54:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:27,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 18:54:27,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:27,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:27,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:27,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:27,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:27,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:27,697 INFO L87 Difference]: Start difference. First operand 1609 states and 2414 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:32,390 INFO L93 Difference]: Finished difference Result 3168 states and 4775 transitions. [2022-02-20 18:54:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 18:54:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2022-02-20 18:54:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2022-02-20 18:54:32,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 343 transitions. [2022-02-20 18:54:32,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:32,712 INFO L225 Difference]: With dead ends: 3168 [2022-02-20 18:54:32,712 INFO L226 Difference]: Without dead ends: 1609 [2022-02-20 18:54:32,714 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:54:32,714 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 504 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:32,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 134 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-02-20 18:54:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2022-02-20 18:54:36,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:36,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.484452736318408) internal successors, (2387), 1608 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:36,665 INFO L74 IsIncluded]: Start isIncluded. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.484452736318408) internal successors, (2387), 1608 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:36,666 INFO L87 Difference]: Start difference. First operand 1609 states. Second operand has 1609 states, 1608 states have (on average 1.484452736318408) internal successors, (2387), 1608 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:36,751 INFO L93 Difference]: Finished difference Result 1609 states and 2387 transitions. [2022-02-20 18:54:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2387 transitions. [2022-02-20 18:54:36,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:36,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:36,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 1609 states, 1608 states have (on average 1.484452736318408) internal successors, (2387), 1608 states have internal predecessors, (2387), 0 states have call successors, (0), 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 1609 states. [2022-02-20 18:54:36,755 INFO L87 Difference]: Start difference. First operand has 1609 states, 1608 states have (on average 1.484452736318408) internal successors, (2387), 1608 states have internal predecessors, (2387), 0 states have call successors, (0), 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 1609 states. [2022-02-20 18:54:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:36,842 INFO L93 Difference]: Finished difference Result 1609 states and 2387 transitions. [2022-02-20 18:54:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2387 transitions. [2022-02-20 18:54:36,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:36,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:36,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:36,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.484452736318408) internal successors, (2387), 1608 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2387 transitions. [2022-02-20 18:54:36,961 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2387 transitions. Word has length 81 [2022-02-20 18:54:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:36,961 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 2387 transitions. [2022-02-20 18:54:36,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2387 transitions. [2022-02-20 18:54:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:54:36,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:36,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:36,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:54:36,962 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1094855209, now seen corresponding path program 1 times [2022-02-20 18:54:36,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:36,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808243860] [2022-02-20 18:54:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:37,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {75562#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(49, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6212~0 := 0;~__return_6321~0 := 0;~__tmp_6500_0~0 := 0;~__return_6518~0 := 0;~__return_6429~0 := 0; {75564#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:37,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {75564#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#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_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {75564#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:37,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {75564#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {75564#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:37,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {75564#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {75564#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:37,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {75564#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {75564#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:37,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {75564#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {75564#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:37,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {75564#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {75564#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:37,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {75564#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {75565#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:37,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {75565#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {75565#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:37,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {75565#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6212~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6212~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {75566#(<= (+ ~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; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {75566#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:37,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {75566#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {75563#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; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {75563#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {75563#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {75563#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; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {75563#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {75563#false} assume ~send4~0 != ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {75563#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {75563#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;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {75563#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {75563#false} assume ~send5~0 != ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {75563#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {75563#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {75563#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {75563#false} assume !(~r1~0 >= 5); {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {75563#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {75563#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6321~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6321~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; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {75563#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {75563#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {75563#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {75563#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {75563#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {75563#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {75563#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {75563#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {75563#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {75563#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {75563#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {75563#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {75563#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {75563#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {75563#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {75563#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {75563#false} ~mode5~0 := 0;~__tmp_6500_0~0 := main_~main____CPAchecker_TMP_0~0#1; {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {75563#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6500_0~0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {75563#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {75563#false} assume !(~r1~0 >= 5); {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {75563#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {75563#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {75563#false} is VALID [2022-02-20 18:54:37,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {75563#false} ~__return_6518~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6518~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; {75563#false} is VALID [2022-02-20 18:54:37,041 INFO L290 TraceCheckUtils]: 80: Hoare triple {75563#false} assume 0 == main_~assert__arg~1#1 % 256; {75563#false} is VALID [2022-02-20 18:54:37,041 INFO L290 TraceCheckUtils]: 81: Hoare triple {75563#false} assume !false; {75563#false} is VALID [2022-02-20 18:54:37,041 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:54:37,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:37,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808243860] [2022-02-20 18:54:37,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808243860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:37,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:37,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:37,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998630990] [2022-02-20 18:54:37,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:54:37,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:37,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:37,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:37,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:37,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:37,096 INFO L87 Difference]: Start difference. First operand 1609 states and 2387 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)