./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.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 379867ea0961f41e6474fa8c55575cf4bd65e7485349e160061a341c7749e45b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:43:38,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:43:38,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:43:38,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:43:38,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:43:38,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:43:38,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:43:38,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:43:38,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:43:38,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:43:38,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:43:38,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:43:38,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:43:38,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:43:38,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:43:38,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:43:38,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:43:38,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:43:38,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:43:38,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:43:38,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:43:38,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:43:38,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:43:38,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:43:38,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:43:38,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:43:38,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:43:38,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:43:38,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:43:38,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:43:38,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:43:38,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:43:38,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:43:38,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:43:38,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:43:38,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:43:38,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:43:38,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:43:38,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:43:38,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:43:38,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:43:38,670 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:43:38,698 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:43:38,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:43:38,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:43:38,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:43:38,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:43:38,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:43:38,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:43:38,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:43:38,702 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:43:38,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:43:38,704 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:43:38,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:43:38,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:43:38,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:43:38,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:43:38,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:43:38,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:43:38,705 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:43:38,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:43:38,705 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:43:38,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:43:38,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:43:38,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:43:38,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:43:38,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:38,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:43:38,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:43:38,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:43:38,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:43:38,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:43:38,709 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:43:38,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:43:38,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:43:38,710 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 -> 379867ea0961f41e6474fa8c55575cf4bd65e7485349e160061a341c7749e45b [2022-02-20 18:43:38,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:43:38,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:43:38,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:43:38,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:43:38,975 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:43:38,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:43:39,031 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da54ee07/14918532b8e74bb290fe8b7b1ebecd35/FLAG3d9b657f9 [2022-02-20 18:43:39,401 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:43:39,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:43:39,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da54ee07/14918532b8e74bb290fe8b7b1ebecd35/FLAG3d9b657f9 [2022-02-20 18:43:39,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da54ee07/14918532b8e74bb290fe8b7b1ebecd35 [2022-02-20 18:43:39,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:43:39,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:43:39,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:39,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:43:39,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:43:39,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:39,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680c5390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39, skipping insertion in model container [2022-02-20 18:43:39,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:39,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:43:39,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:43:39,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2022-02-20 18:43:39,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:39,777 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:43:39,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2022-02-20 18:43:39,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:39,898 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:43:39,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39 WrapperNode [2022-02-20 18:43:39,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:39,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:39,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:43:39,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:43:39,912 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:43:39" (1/1) ... [2022-02-20 18:43:39,923 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:43:39" (1/1) ... [2022-02-20 18:43:39,969 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 613 [2022-02-20 18:43:39,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:39,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:43:39,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:43:39,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:43:39,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:39,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:40,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:40,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:40,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:40,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:40,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:40,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:43:40,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:43:40,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:43:40,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:43:40,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (1/1) ... [2022-02-20 18:43:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:43:40,073 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:43:40,075 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:43:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:43:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:43:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:43:40,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:43:40,179 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:43:40,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:43:40,740 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:43:40,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:43:40,747 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:43:40,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:40 BoogieIcfgContainer [2022-02-20 18:43:40,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:43:40,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:43:40,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:43:40,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:43:40,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:43:39" (1/3) ... [2022-02-20 18:43:40,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ed9982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:40, skipping insertion in model container [2022-02-20 18:43:40,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:39" (2/3) ... [2022-02-20 18:43:40,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ed9982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:40, skipping insertion in model container [2022-02-20 18:43:40,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:40" (3/3) ... [2022-02-20 18:43:40,755 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:43:40,759 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:43:40,759 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:43:40,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:43:40,800 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:43:40,800 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:43:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:43:40,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:40,823 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] [2022-02-20 18:43:40,824 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash 985312972, now seen corresponding path program 1 times [2022-02-20 18:43:40,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:40,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683260512] [2022-02-20 18:43:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:41,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {165#true} is VALID [2022-02-20 18:43:41,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {165#true} is VALID [2022-02-20 18:43:41,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume 0 == ~r1~0; {165#true} is VALID [2022-02-20 18:43:41,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {165#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {165#true} is VALID [2022-02-20 18:43:41,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {165#true} assume ~id1~0 >= 0; {165#true} is VALID [2022-02-20 18:43:41,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} assume 0 == ~st1~0; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:41,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:41,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:41,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#(<= ~st1~0 0)} assume ~id2~0 >= 0; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:41,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(<= ~st1~0 0)} assume 0 == ~st2~0; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {169#(<= (+ ~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;main_~main__i2~0#1 := 0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {169#(<= (+ ~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {169#(<= (+ ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {169#(<= (+ ~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {169#(<= (+ ~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:41,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {166#false} is VALID [2022-02-20 18:43:41,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {166#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {166#false} is VALID [2022-02-20 18:43:41,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {166#false} assume 0 == main_~assert__arg~2#1 % 256; {166#false} is VALID [2022-02-20 18:43:41,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-02-20 18:43:41,224 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:43:41,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:41,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683260512] [2022-02-20 18:43:41,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683260512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:41,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:41,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:41,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701534225] [2022-02-20 18:43:41,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:43:41,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:41,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:41,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:41,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:41,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:41,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:41,319 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:42,638 INFO L93 Difference]: Finished difference Result 517 states and 836 transitions. [2022-02-20 18:43:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:42,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:43:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2022-02-20 18:43:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2022-02-20 18:43:42,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 836 transitions. [2022-02-20 18:43:43,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 836 edges. 836 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:43,345 INFO L225 Difference]: With dead ends: 517 [2022-02-20 18:43:43,345 INFO L226 Difference]: Without dead ends: 438 [2022-02-20 18:43:43,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:43:43,351 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 913 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:43,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 1288 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:43:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-02-20 18:43:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 256. [2022-02-20 18:43:43,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:43,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:43,459 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:43,460 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:43,477 INFO L93 Difference]: Finished difference Result 438 states and 663 transitions. [2022-02-20 18:43:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 663 transitions. [2022-02-20 18:43:43,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:43,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:43,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 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 438 states. [2022-02-20 18:43:43,481 INFO L87 Difference]: Start difference. First operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 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 438 states. [2022-02-20 18:43:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:43,498 INFO L93 Difference]: Finished difference Result 438 states and 663 transitions. [2022-02-20 18:43:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 663 transitions. [2022-02-20 18:43:43,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:43,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:43,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:43,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2022-02-20 18:43:43,510 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 50 [2022-02-20 18:43:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:43,511 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2022-02-20 18:43:43,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2022-02-20 18:43:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:43:43,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:43,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:43,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:43:43,513 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash -722006169, now seen corresponding path program 1 times [2022-02-20 18:43:43,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:43,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976629029] [2022-02-20 18:43:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:43,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {2074#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {2074#true} is VALID [2022-02-20 18:43:43,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {2074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {2074#true} is VALID [2022-02-20 18:43:43,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {2074#true} assume 0 == ~r1~0; {2074#true} is VALID [2022-02-20 18:43:43,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {2074#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {2074#true} is VALID [2022-02-20 18:43:43,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {2074#true} assume ~id1~0 >= 0; {2074#true} is VALID [2022-02-20 18:43:43,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {2074#true} assume 0 == ~st1~0; {2074#true} is VALID [2022-02-20 18:43:43,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {2074#true} assume ~send1~0 == ~id1~0; {2074#true} is VALID [2022-02-20 18:43:43,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {2074#true} assume 0 == ~mode1~0 % 256; {2074#true} is VALID [2022-02-20 18:43:43,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {2074#true} assume ~id2~0 >= 0; {2074#true} is VALID [2022-02-20 18:43:43,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {2074#true} assume 0 == ~st2~0; {2074#true} is VALID [2022-02-20 18:43:43,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {2074#true} assume ~send2~0 == ~id2~0; {2074#true} is VALID [2022-02-20 18:43:43,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {2074#true} assume 0 == ~mode2~0 % 256; {2074#true} is VALID [2022-02-20 18:43:43,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {2074#true} assume ~id3~0 >= 0; {2074#true} is VALID [2022-02-20 18:43:43,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {2074#true} assume 0 == ~st3~0; {2074#true} is VALID [2022-02-20 18:43:43,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {2074#true} assume ~send3~0 == ~id3~0; {2074#true} is VALID [2022-02-20 18:43:43,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {2074#true} assume 0 == ~mode3~0 % 256; {2074#true} is VALID [2022-02-20 18:43:43,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {2074#true} assume ~id1~0 != ~id2~0; {2074#true} is VALID [2022-02-20 18:43:43,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {2074#true} assume ~id1~0 != ~id3~0; {2074#true} is VALID [2022-02-20 18:43:43,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {2074#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {2074#true} is VALID [2022-02-20 18:43:43,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {2074#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2074#true} is VALID [2022-02-20 18:43:43,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {2074#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2074#true} is VALID [2022-02-20 18:43:43,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {2074#true} assume !!(0 == ~mode1~0 % 256); {2074#true} is VALID [2022-02-20 18:43:43,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {2074#true} assume !!(0 == ~alive1~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 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; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:43,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {2075#false} is VALID [2022-02-20 18:43:43,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {2075#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2075#false} is VALID [2022-02-20 18:43:43,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {2075#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {2075#false} is VALID [2022-02-20 18:43:43,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {2075#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:43:43,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {2075#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:43:43,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {2075#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2075#false} is VALID [2022-02-20 18:43:43,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {2075#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:43:43,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {2075#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:43:43,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {2075#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2075#false} is VALID [2022-02-20 18:43:43,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {2075#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {2075#false} is VALID [2022-02-20 18:43:43,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {2075#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2075#false} is VALID [2022-02-20 18:43:43,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {2075#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {2075#false} is VALID [2022-02-20 18:43:43,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {2075#false} assume 0 == main_~assert__arg~2#1 % 256; {2075#false} is VALID [2022-02-20 18:43:43,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {2075#false} assume !false; {2075#false} is VALID [2022-02-20 18:43:43,617 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:43:43,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:43,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976629029] [2022-02-20 18:43:43,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976629029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:43,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:43,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:43,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801572171] [2022-02-20 18:43:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:43:43,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:43,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:43,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:43,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:43,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:43,664 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:44,112 INFO L93 Difference]: Finished difference Result 628 states and 954 transitions. [2022-02-20 18:43:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:44,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:43:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:43:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:43:44,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 547 transitions. [2022-02-20 18:43:44,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:44,535 INFO L225 Difference]: With dead ends: 628 [2022-02-20 18:43:44,535 INFO L226 Difference]: Without dead ends: 430 [2022-02-20 18:43:44,536 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:43:44,538 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 158 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:44,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-02-20 18:43:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2022-02-20 18:43:44,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:44,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 430 states. Second operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,682 INFO L74 IsIncluded]: Start isIncluded. First operand 430 states. Second operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,683 INFO L87 Difference]: Start difference. First operand 430 states. Second operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:44,698 INFO L93 Difference]: Finished difference Result 430 states and 635 transitions. [2022-02-20 18:43:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 635 transitions. [2022-02-20 18:43:44,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:44,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:44,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 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 430 states. [2022-02-20 18:43:44,702 INFO L87 Difference]: Start difference. First operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 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 430 states. [2022-02-20 18:43:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:44,717 INFO L93 Difference]: Finished difference Result 430 states and 635 transitions. [2022-02-20 18:43:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 635 transitions. [2022-02-20 18:43:44,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:44,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:44,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:44,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2022-02-20 18:43:44,734 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 53 [2022-02-20 18:43:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:44,734 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2022-02-20 18:43:44,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2022-02-20 18:43:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:43:44,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:44,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:44,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:43:44,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash -695460410, now seen corresponding path program 1 times [2022-02-20 18:43:44,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:44,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039663130] [2022-02-20 18:43:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:44,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {4333#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {4333#true} is VALID [2022-02-20 18:43:44,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {4333#true} is VALID [2022-02-20 18:43:44,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {4333#true} assume 0 == ~r1~0; {4333#true} is VALID [2022-02-20 18:43:44,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {4333#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {4333#true} is VALID [2022-02-20 18:43:44,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {4333#true} assume ~id1~0 >= 0; {4333#true} is VALID [2022-02-20 18:43:44,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {4333#true} assume 0 == ~st1~0; {4333#true} is VALID [2022-02-20 18:43:44,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {4333#true} assume ~send1~0 == ~id1~0; {4333#true} is VALID [2022-02-20 18:43:44,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {4333#true} assume 0 == ~mode1~0 % 256; {4333#true} is VALID [2022-02-20 18:43:44,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {4333#true} assume ~id2~0 >= 0; {4333#true} is VALID [2022-02-20 18:43:44,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {4333#true} assume 0 == ~st2~0; {4333#true} is VALID [2022-02-20 18:43:44,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {4333#true} assume ~send2~0 == ~id2~0; {4333#true} is VALID [2022-02-20 18:43:44,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {4333#true} assume 0 == ~mode2~0 % 256; {4333#true} is VALID [2022-02-20 18:43:44,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {4333#true} assume ~id3~0 >= 0; {4333#true} is VALID [2022-02-20 18:43:44,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {4333#true} assume 0 == ~st3~0; {4333#true} is VALID [2022-02-20 18:43:44,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {4333#true} assume ~send3~0 == ~id3~0; {4333#true} is VALID [2022-02-20 18:43:44,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {4333#true} assume 0 == ~mode3~0 % 256; {4333#true} is VALID [2022-02-20 18:43:44,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {4333#true} assume ~id1~0 != ~id2~0; {4333#true} is VALID [2022-02-20 18:43:44,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {4333#true} assume ~id1~0 != ~id3~0; {4333#true} is VALID [2022-02-20 18:43:44,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {4333#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {4333#true} is VALID [2022-02-20 18:43:44,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {4333#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4333#true} is VALID [2022-02-20 18:43:44,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {4333#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4333#true} is VALID [2022-02-20 18:43:44,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {4333#true} assume !!(0 == ~mode1~0 % 256); {4333#true} is VALID [2022-02-20 18:43:44,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {4333#true} assume !!(0 == ~alive1~0 % 256); {4333#true} is VALID [2022-02-20 18:43:44,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {4333#true} assume !(~send1~0 != ~id1~0); {4333#true} is VALID [2022-02-20 18:43:44,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {4333#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4333#true} is VALID [2022-02-20 18:43:44,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {4333#true} assume !!(0 == ~mode2~0 % 256); {4333#true} is VALID [2022-02-20 18:43:44,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {4333#true} assume !!(0 == ~alive2~0 % 256); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~id3~0); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~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; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:44,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {4334#false} is VALID [2022-02-20 18:43:44,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {4334#false} assume !(main_~node2__m2~1#1 > ~id2~0); {4334#false} is VALID [2022-02-20 18:43:44,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {4334#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {4334#false} is VALID [2022-02-20 18:43:44,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {4334#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4334#false} is VALID [2022-02-20 18:43:44,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {4334#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4334#false} is VALID [2022-02-20 18:43:44,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {4334#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4334#false} is VALID [2022-02-20 18:43:44,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {4334#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {4334#false} is VALID [2022-02-20 18:43:44,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {4334#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4334#false} is VALID [2022-02-20 18:43:44,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {4334#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {4334#false} is VALID [2022-02-20 18:43:44,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {4334#false} assume 0 == main_~assert__arg~2#1 % 256; {4334#false} is VALID [2022-02-20 18:43:44,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2022-02-20 18:43:44,831 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:43:44,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:44,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039663130] [2022-02-20 18:43:44,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039663130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:44,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:44,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:44,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80443415] [2022-02-20 18:43:44,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:43:44,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:44,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:44,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:44,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:44,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:44,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:44,877 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:45,467 INFO L93 Difference]: Finished difference Result 1078 states and 1615 transitions. [2022-02-20 18:43:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:43:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2022-02-20 18:43:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2022-02-20 18:43:45,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 541 transitions. [2022-02-20 18:43:45,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:45,913 INFO L225 Difference]: With dead ends: 1078 [2022-02-20 18:43:45,913 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 18:43:45,916 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:43:45,923 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 157 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:45,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 18:43:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2022-02-20 18:43:46,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:46,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,156 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,157 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:46,185 INFO L93 Difference]: Finished difference Result 750 states and 1101 transitions. [2022-02-20 18:43:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1101 transitions. [2022-02-20 18:43:46,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:46,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:46,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 750 states. [2022-02-20 18:43:46,192 INFO L87 Difference]: Start difference. First operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 750 states. [2022-02-20 18:43:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:46,218 INFO L93 Difference]: Finished difference Result 750 states and 1101 transitions. [2022-02-20 18:43:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1101 transitions. [2022-02-20 18:43:46,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:46,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:46,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:46,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1100 transitions. [2022-02-20 18:43:46,256 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1100 transitions. Word has length 53 [2022-02-20 18:43:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:46,257 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1100 transitions. [2022-02-20 18:43:46,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1100 transitions. [2022-02-20 18:43:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:43:46,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:46,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:46,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:43:46,259 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:46,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash -272648633, now seen corresponding path program 1 times [2022-02-20 18:43:46,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:46,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439126696] [2022-02-20 18:43:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:46,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {8270#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {8270#true} is VALID [2022-02-20 18:43:46,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {8270#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {8270#true} is VALID [2022-02-20 18:43:46,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {8270#true} assume 0 == ~r1~0; {8270#true} is VALID [2022-02-20 18:43:46,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {8270#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {8270#true} is VALID [2022-02-20 18:43:46,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {8270#true} assume ~id1~0 >= 0; {8270#true} is VALID [2022-02-20 18:43:46,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {8270#true} assume 0 == ~st1~0; {8270#true} is VALID [2022-02-20 18:43:46,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {8270#true} assume ~send1~0 == ~id1~0; {8270#true} is VALID [2022-02-20 18:43:46,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {8270#true} assume 0 == ~mode1~0 % 256; {8270#true} is VALID [2022-02-20 18:43:46,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {8270#true} assume ~id2~0 >= 0; {8270#true} is VALID [2022-02-20 18:43:46,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {8270#true} assume 0 == ~st2~0; {8270#true} is VALID [2022-02-20 18:43:46,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {8270#true} assume ~send2~0 == ~id2~0; {8270#true} is VALID [2022-02-20 18:43:46,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {8270#true} assume 0 == ~mode2~0 % 256; {8270#true} is VALID [2022-02-20 18:43:46,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {8270#true} assume ~id3~0 >= 0; {8270#true} is VALID [2022-02-20 18:43:46,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {8270#true} assume 0 == ~st3~0; {8270#true} is VALID [2022-02-20 18:43:46,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {8270#true} assume ~send3~0 == ~id3~0; {8270#true} is VALID [2022-02-20 18:43:46,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {8270#true} assume 0 == ~mode3~0 % 256; {8270#true} is VALID [2022-02-20 18:43:46,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {8270#true} assume ~id1~0 != ~id2~0; {8270#true} is VALID [2022-02-20 18:43:46,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {8270#true} assume ~id1~0 != ~id3~0; {8270#true} is VALID [2022-02-20 18:43:46,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {8270#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {8270#true} is VALID [2022-02-20 18:43:46,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {8270#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8270#true} is VALID [2022-02-20 18:43:46,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {8270#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8270#true} is VALID [2022-02-20 18:43:46,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {8270#true} assume !!(0 == ~mode1~0 % 256); {8270#true} is VALID [2022-02-20 18:43:46,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {8270#true} assume !!(0 == ~alive1~0 % 256); {8270#true} is VALID [2022-02-20 18:43:46,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {8270#true} assume !(~send1~0 != ~id1~0); {8270#true} is VALID [2022-02-20 18:43:46,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {8270#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8270#true} is VALID [2022-02-20 18:43:46,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {8270#true} assume !!(0 == ~mode2~0 % 256); {8270#true} is VALID [2022-02-20 18:43:46,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {8270#true} assume !!(0 == ~alive2~0 % 256); {8270#true} is VALID [2022-02-20 18:43:46,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {8270#true} assume !(~send2~0 != ~id2~0); {8270#true} is VALID [2022-02-20 18:43:46,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {8270#true} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8270#true} is VALID [2022-02-20 18:43:46,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {8270#true} assume !!(0 == ~mode3~0 % 256); {8270#true} is VALID [2022-02-20 18:43:46,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {8270#true} assume !!(0 == ~alive3~0 % 256); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~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; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:43:46,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {8271#false} is VALID [2022-02-20 18:43:46,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {8271#false} assume !(main_~node3__m3~1#1 > ~id3~0); {8271#false} is VALID [2022-02-20 18:43:46,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {8271#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {8271#false} is VALID [2022-02-20 18:43:46,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {8271#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {8271#false} is VALID [2022-02-20 18:43:46,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {8271#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8271#false} is VALID [2022-02-20 18:43:46,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {8271#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {8271#false} is VALID [2022-02-20 18:43:46,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {8271#false} assume 0 == main_~assert__arg~2#1 % 256; {8271#false} is VALID [2022-02-20 18:43:46,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {8271#false} assume !false; {8271#false} is VALID [2022-02-20 18:43:46,389 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:43:46,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:46,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439126696] [2022-02-20 18:43:46,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439126696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:46,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:46,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:46,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460303456] [2022-02-20 18:43:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:43:46,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:46,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:46,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:46,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:46,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:46,447 INFO L87 Difference]: Start difference. First operand 748 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:47,263 INFO L93 Difference]: Finished difference Result 1859 states and 2747 transitions. [2022-02-20 18:43:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:47,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:43:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-02-20 18:43:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-02-20 18:43:47,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 517 transitions. [2022-02-20 18:43:47,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:47,737 INFO L225 Difference]: With dead ends: 1859 [2022-02-20 18:43:47,737 INFO L226 Difference]: Without dead ends: 1295 [2022-02-20 18:43:47,738 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:43:47,739 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:47,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-02-20 18:43:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1293. [2022-02-20 18:43:48,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:48,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1295 states. Second operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:48,136 INFO L74 IsIncluded]: Start isIncluded. First operand 1295 states. Second operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:48,139 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:48,231 INFO L93 Difference]: Finished difference Result 1295 states and 1875 transitions. [2022-02-20 18:43:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1875 transitions. [2022-02-20 18:43:48,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:48,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:48,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 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 1295 states. [2022-02-20 18:43:48,240 INFO L87 Difference]: Start difference. First operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 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 1295 states. [2022-02-20 18:43:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:48,317 INFO L93 Difference]: Finished difference Result 1295 states and 1875 transitions. [2022-02-20 18:43:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1875 transitions. [2022-02-20 18:43:48,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:48,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:48,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:48,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1874 transitions. [2022-02-20 18:43:48,425 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1874 transitions. Word has length 53 [2022-02-20 18:43:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:48,426 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1874 transitions. [2022-02-20 18:43:48,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1874 transitions. [2022-02-20 18:43:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:43:48,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:48,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:48,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:43:48,429 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1724922721, now seen corresponding path program 1 times [2022-02-20 18:43:48,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:48,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975392649] [2022-02-20 18:43:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:48,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {15099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {15099#true} is VALID [2022-02-20 18:43:48,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {15099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {15099#true} is VALID [2022-02-20 18:43:48,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {15099#true} assume 0 == ~r1~0; {15099#true} is VALID [2022-02-20 18:43:48,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {15099#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {15099#true} is VALID [2022-02-20 18:43:48,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {15099#true} assume ~id1~0 >= 0; {15099#true} is VALID [2022-02-20 18:43:48,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {15099#true} assume 0 == ~st1~0; {15099#true} is VALID [2022-02-20 18:43:48,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {15099#true} assume ~send1~0 == ~id1~0; {15099#true} is VALID [2022-02-20 18:43:48,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {15099#true} assume 0 == ~mode1~0 % 256; {15099#true} is VALID [2022-02-20 18:43:48,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {15099#true} assume ~id2~0 >= 0; {15099#true} is VALID [2022-02-20 18:43:48,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {15099#true} assume 0 == ~st2~0; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:43:48,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {15101#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:43:48,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {15101#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:43:48,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {15101#(<= ~st2~0 0)} assume ~id3~0 >= 0; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:43:48,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#(<= ~st2~0 0)} assume 0 == ~st3~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {15102#(<= (+ ~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;main_~main__i2~0#1 := 0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {15102#(<= (+ ~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); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive2~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~id2~0); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive3~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~id3~0); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {15102#(<= (+ ~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; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {15102#(<= (+ ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:43:48,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:43:48,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {15100#false} is VALID [2022-02-20 18:43:48,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {15100#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {15100#false} is VALID [2022-02-20 18:43:48,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {15100#false} assume 0 == main_~assert__arg~2#1 % 256; {15100#false} is VALID [2022-02-20 18:43:48,539 INFO L290 TraceCheckUtils]: 53: Hoare triple {15100#false} assume !false; {15100#false} is VALID [2022-02-20 18:43:48,540 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:43:48,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:48,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975392649] [2022-02-20 18:43:48,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975392649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:48,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:48,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:48,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334385357] [2022-02-20 18:43:48,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:43:48,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:48,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:48,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:48,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:48,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:48,595 INFO L87 Difference]: Start difference. First operand 1293 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:50,635 INFO L93 Difference]: Finished difference Result 2516 states and 3713 transitions. [2022-02-20 18:43:50,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:43:50,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:43:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:43:50,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 763 transitions. [2022-02-20 18:43:51,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:51,363 INFO L225 Difference]: With dead ends: 2516 [2022-02-20 18:43:51,364 INFO L226 Difference]: Without dead ends: 2150 [2022-02-20 18:43:51,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:43:51,365 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 634 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:51,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 1128 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:43:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-02-20 18:43:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1745. [2022-02-20 18:43:52,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:52,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2150 states. Second operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:52,330 INFO L74 IsIncluded]: Start isIncluded. First operand 2150 states. Second operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:52,333 INFO L87 Difference]: Start difference. First operand 2150 states. Second operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:52,473 INFO L93 Difference]: Finished difference Result 2150 states and 3148 transitions. [2022-02-20 18:43:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3148 transitions. [2022-02-20 18:43:52,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:52,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:52,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:43:52,482 INFO L87 Difference]: Start difference. First operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:43:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:52,638 INFO L93 Difference]: Finished difference Result 2150 states and 3148 transitions. [2022-02-20 18:43:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3148 transitions. [2022-02-20 18:43:52,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:52,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:52,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:52,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2543 transitions. [2022-02-20 18:43:52,778 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2543 transitions. Word has length 54 [2022-02-20 18:43:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:52,778 INFO L470 AbstractCegarLoop]: Abstraction has 1745 states and 2543 transitions. [2022-02-20 18:43:52,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2543 transitions. [2022-02-20 18:43:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:43:52,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:52,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:52,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:43:52,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1943574737, now seen corresponding path program 1 times [2022-02-20 18:43:52,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:52,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645692013] [2022-02-20 18:43:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:52,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {25204#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {25204#true} is VALID [2022-02-20 18:43:52,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {25204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {25204#true} is VALID [2022-02-20 18:43:52,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {25204#true} assume 0 == ~r1~0; {25204#true} is VALID [2022-02-20 18:43:52,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {25204#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {25204#true} is VALID [2022-02-20 18:43:52,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {25204#true} assume ~id1~0 >= 0; {25204#true} is VALID [2022-02-20 18:43:52,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {25204#true} assume 0 == ~st1~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {25206#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {25206#(<= ~st1~0 0)} assume ~id2~0 >= 0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~st2~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {25206#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {25206#(<= ~st1~0 0)} assume ~id3~0 >= 0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:52,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~st3~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {25207#(<= (+ ~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;main_~main__i2~0#1 := 0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {25207#(<= (+ ~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); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {25207#(<= (+ ~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; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {25207#(<= (+ ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:52,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:43:52,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {25208#(and (<= (+ ~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; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:43:52,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {25208#(and (<= (+ ~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; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:43:52,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:43:52,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:43:52,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {25205#false} is VALID [2022-02-20 18:43:52,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {25205#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {25205#false} is VALID [2022-02-20 18:43:52,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {25205#false} assume 0 == main_~assert__arg~2#1 % 256; {25205#false} is VALID [2022-02-20 18:43:52,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {25205#false} assume !false; {25205#false} is VALID [2022-02-20 18:43:52,894 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:43:52,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:52,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645692013] [2022-02-20 18:43:52,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645692013] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:52,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:52,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:52,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680879182] [2022-02-20 18:43:52,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:43:52,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:52,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:52,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:52,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:52,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:52,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:52,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:52,959 INFO L87 Difference]: Start difference. First operand 1745 states and 2543 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:55,296 INFO L93 Difference]: Finished difference Result 2968 states and 4382 transitions. [2022-02-20 18:43:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:55,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:43:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:43:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:43:55,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 763 transitions. [2022-02-20 18:43:55,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:56,028 INFO L225 Difference]: With dead ends: 2968 [2022-02-20 18:43:56,028 INFO L226 Difference]: Without dead ends: 2602 [2022-02-20 18:43:56,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:43:56,030 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 626 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:56,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 987 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-02-20 18:43:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2091. [2022-02-20 18:43:57,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:57,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2602 states. Second operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,294 INFO L74 IsIncluded]: Start isIncluded. First operand 2602 states. Second operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,297 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:57,496 INFO L93 Difference]: Finished difference Result 2602 states and 3817 transitions. [2022-02-20 18:43:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3817 transitions. [2022-02-20 18:43:57,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:57,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:57,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 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 2602 states. [2022-02-20 18:43:57,505 INFO L87 Difference]: Start difference. First operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 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 2602 states. [2022-02-20 18:43:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:57,701 INFO L93 Difference]: Finished difference Result 2602 states and 3817 transitions. [2022-02-20 18:43:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3817 transitions. [2022-02-20 18:43:57,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:57,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:57,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:57,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3058 transitions. [2022-02-20 18:43:57,887 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3058 transitions. Word has length 54 [2022-02-20 18:43:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:57,887 INFO L470 AbstractCegarLoop]: Abstraction has 2091 states and 3058 transitions. [2022-02-20 18:43:57,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3058 transitions. [2022-02-20 18:43:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:43:57,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:57,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:57,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:43:57,889 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash -867408349, now seen corresponding path program 1 times [2022-02-20 18:43:57,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:57,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272110433] [2022-02-20 18:43:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:57,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {37323#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {37323#true} is VALID [2022-02-20 18:43:57,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {37323#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {37323#true} is VALID [2022-02-20 18:43:57,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {37323#true} assume 0 == ~r1~0; {37323#true} is VALID [2022-02-20 18:43:57,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {37323#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {37323#true} is VALID [2022-02-20 18:43:57,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {37323#true} assume ~id1~0 >= 0; {37323#true} is VALID [2022-02-20 18:43:57,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {37323#true} assume 0 == ~st1~0; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:57,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {37325#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:57,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {37325#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:57,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {37325#(<= ~st1~0 0)} assume ~id2~0 >= 0; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:57,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {37325#(<= ~st1~0 0)} assume 0 == ~st2~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {37326#(<= (+ ~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;main_~main__i2~0#1 := 0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {37326#(<= (+ ~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); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {37326#(<= (+ ~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; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {37326#(<= (+ ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:57,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:43:57,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:43:57,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {37324#false} is VALID [2022-02-20 18:43:57,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {37324#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {37324#false} is VALID [2022-02-20 18:43:57,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {37324#false} assume 0 == main_~assert__arg~2#1 % 256; {37324#false} is VALID [2022-02-20 18:43:57,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {37324#false} assume !false; {37324#false} is VALID [2022-02-20 18:43:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:43:57,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:57,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272110433] [2022-02-20 18:43:57,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272110433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:57,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:57,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:57,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370729944] [2022-02-20 18:43:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:57,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:43:57,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:57,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:58,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:58,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:58,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:58,011 INFO L87 Difference]: Start difference. First operand 2091 states and 3058 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:00,617 INFO L93 Difference]: Finished difference Result 3367 states and 4972 transitions. [2022-02-20 18:44:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:00,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:44:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:44:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:44:00,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 763 transitions. [2022-02-20 18:44:01,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:01,460 INFO L225 Difference]: With dead ends: 3367 [2022-02-20 18:44:01,460 INFO L226 Difference]: Without dead ends: 3001 [2022-02-20 18:44:01,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:01,461 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 630 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:01,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1056 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2022-02-20 18:44:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2382. [2022-02-20 18:44:02,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:02,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3001 states. Second operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:02,914 INFO L74 IsIncluded]: Start isIncluded. First operand 3001 states. Second operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:02,917 INFO L87 Difference]: Start difference. First operand 3001 states. Second operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:03,198 INFO L93 Difference]: Finished difference Result 3001 states and 4407 transitions. [2022-02-20 18:44:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4407 transitions. [2022-02-20 18:44:03,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:03,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:03,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 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 3001 states. [2022-02-20 18:44:03,217 INFO L87 Difference]: Start difference. First operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 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 3001 states. [2022-02-20 18:44:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:03,526 INFO L93 Difference]: Finished difference Result 3001 states and 4407 transitions. [2022-02-20 18:44:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4407 transitions. [2022-02-20 18:44:03,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:03,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:03,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:03,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3492 transitions. [2022-02-20 18:44:03,732 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3492 transitions. Word has length 54 [2022-02-20 18:44:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:03,732 INFO L470 AbstractCegarLoop]: Abstraction has 2382 states and 3492 transitions. [2022-02-20 18:44:03,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3492 transitions. [2022-02-20 18:44:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:44:03,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:03,734 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] [2022-02-20 18:44:03,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:03,734 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash -554993830, now seen corresponding path program 1 times [2022-02-20 18:44:03,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:03,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739892692] [2022-02-20 18:44:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:03,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {51199#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:03,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:03,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:03,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:03,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {51202#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:03,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {51202#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {51202#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:03,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {51202#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:03,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {51200#false} is VALID [2022-02-20 18:44:03,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {51200#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); {51200#false} is VALID [2022-02-20 18:44:03,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {51200#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {51200#false} assume !!(0 == ~mode2~0 % 256); {51200#false} is VALID [2022-02-20 18:44:03,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {51200#false} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {51200#false} is VALID [2022-02-20 18:44:03,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {51200#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {51200#false} is VALID [2022-02-20 18:44:03,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {51200#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); {51200#false} is VALID [2022-02-20 18:44:03,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {51200#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {51200#false} assume !!(0 == ~mode3~0 % 256); {51200#false} is VALID [2022-02-20 18:44:03,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {51200#false} assume !!(0 == ~alive3~0 % 256); {51200#false} is VALID [2022-02-20 18:44:03,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {51200#false} assume !(~send3~0 != ~id3~0); {51200#false} is VALID [2022-02-20 18:44:03,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {51200#false} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {51200#false} is VALID [2022-02-20 18:44:03,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {51200#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {51200#false} is VALID [2022-02-20 18:44:03,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {51200#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {51200#false} is VALID [2022-02-20 18:44:03,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {51200#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; {51200#false} is VALID [2022-02-20 18:44:03,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {51200#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {51200#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {51200#false} assume main_~node1__m1~1#1 != ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {51200#false} assume !(0 == ~alive1~0 % 256); {51200#false} is VALID [2022-02-20 18:44:03,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {51200#false} assume !(main_~node1__m1~1#1 > ~id1~0); {51200#false} is VALID [2022-02-20 18:44:03,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {51200#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {51200#false} is VALID [2022-02-20 18:44:03,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {51200#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {51200#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {51200#false} assume main_~node2__m2~1#1 != ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {51200#false} assume !(0 == ~alive2~0 % 256); {51200#false} is VALID [2022-02-20 18:44:03,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {51200#false} assume !(main_~node2__m2~1#1 > ~id2~0); {51200#false} is VALID [2022-02-20 18:44:03,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {51200#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {51200#false} is VALID [2022-02-20 18:44:03,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {51200#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {51200#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:44:03,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {51200#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {51200#false} is VALID [2022-02-20 18:44:03,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {51200#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {51200#false} is VALID [2022-02-20 18:44:03,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {51200#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {51200#false} is VALID [2022-02-20 18:44:03,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {51200#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {51200#false} is VALID [2022-02-20 18:44:03,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {51200#false} assume 0 == main_~assert__arg~2#1 % 256; {51200#false} is VALID [2022-02-20 18:44:03,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {51200#false} assume !false; {51200#false} is VALID [2022-02-20 18:44:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:03,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:03,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739892692] [2022-02-20 18:44:03,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739892692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:03,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:03,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:03,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541200963] [2022-02-20 18:44:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:03,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:44:03,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:03,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:03,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:03,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:03,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:03,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:03,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:03,849 INFO L87 Difference]: Start difference. First operand 2382 states and 3492 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:10,434 INFO L93 Difference]: Finished difference Result 6768 states and 9953 transitions. [2022-02-20 18:44:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:44:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-02-20 18:44:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-02-20 18:44:10,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 585 transitions. [2022-02-20 18:44:10,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 585 edges. 585 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:11,595 INFO L225 Difference]: With dead ends: 6768 [2022-02-20 18:44:11,595 INFO L226 Difference]: Without dead ends: 4414 [2022-02-20 18:44:11,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:11,598 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 927 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:11,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 216 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2022-02-20 18:44:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4387. [2022-02-20 18:44:15,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:15,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4414 states. Second operand has 4387 states, 4386 states have (on average 1.459188326493388) internal successors, (6400), 4386 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:15,934 INFO L74 IsIncluded]: Start isIncluded. First operand 4414 states. Second operand has 4387 states, 4386 states have (on average 1.459188326493388) internal successors, (6400), 4386 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:15,938 INFO L87 Difference]: Start difference. First operand 4414 states. Second operand has 4387 states, 4386 states have (on average 1.459188326493388) internal successors, (6400), 4386 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:16,495 INFO L93 Difference]: Finished difference Result 4414 states and 6426 transitions. [2022-02-20 18:44:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 6426 transitions. [2022-02-20 18:44:16,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:16,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:16,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 4387 states, 4386 states have (on average 1.459188326493388) internal successors, (6400), 4386 states have internal predecessors, (6400), 0 states have call successors, (0), 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 4414 states. [2022-02-20 18:44:16,508 INFO L87 Difference]: Start difference. First operand has 4387 states, 4386 states have (on average 1.459188326493388) internal successors, (6400), 4386 states have internal predecessors, (6400), 0 states have call successors, (0), 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 4414 states. [2022-02-20 18:44:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:17,160 INFO L93 Difference]: Finished difference Result 4414 states and 6426 transitions. [2022-02-20 18:44:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 6426 transitions. [2022-02-20 18:44:17,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:17,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:17,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:17,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4387 states, 4386 states have (on average 1.459188326493388) internal successors, (6400), 4386 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 6400 transitions. [2022-02-20 18:44:18,014 INFO L78 Accepts]: Start accepts. Automaton has 4387 states and 6400 transitions. Word has length 58 [2022-02-20 18:44:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:18,017 INFO L470 AbstractCegarLoop]: Abstraction has 4387 states and 6400 transitions. [2022-02-20 18:44:18,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4387 states and 6400 transitions. [2022-02-20 18:44:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:44:18,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:18,020 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] [2022-02-20 18:44:18,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:44:18,020 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 500702524, now seen corresponding path program 1 times [2022-02-20 18:44:18,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:18,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132825509] [2022-02-20 18:44:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:18,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {75331#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6421~0 := 0;~__return_6484~0 := 0;~__tmp_6512_0~0 := 0;~__return_6554~0 := 0;~__tmp_6555_0~0 := 0;~__return_6568~0 := 0;~__return_6743~0 := 0; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {75333#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {75333#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {75334#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:18,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {75334#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {75334#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:18,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {75334#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {75335#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:18,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {75335#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {75332#false} is VALID [2022-02-20 18:44:18,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {75332#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); {75332#false} is VALID [2022-02-20 18:44:18,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {75332#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {75332#false} assume !!(0 == ~mode3~0 % 256); {75332#false} is VALID [2022-02-20 18:44:18,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {75332#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {75332#false} is VALID [2022-02-20 18:44:18,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {75332#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {75332#false} is VALID [2022-02-20 18:44:18,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {75332#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); {75332#false} is VALID [2022-02-20 18:44:18,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {75332#false} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {75332#false} is VALID [2022-02-20 18:44:18,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {75332#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {75332#false} is VALID [2022-02-20 18:44:18,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {75332#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6421~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6421~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; {75332#false} is VALID [2022-02-20 18:44:18,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {75332#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; {75332#false} is VALID [2022-02-20 18:44:18,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {75332#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {75332#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {75332#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {75332#false} is VALID [2022-02-20 18:44:18,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {75332#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {75332#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {75332#false} assume main_~node2__m2~1#1 != ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {75332#false} assume !(0 == ~alive2~0 % 256); {75332#false} is VALID [2022-02-20 18:44:18,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {75332#false} assume !(main_~node2__m2~1#1 > ~id2~0); {75332#false} is VALID [2022-02-20 18:44:18,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {75332#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {75332#false} is VALID [2022-02-20 18:44:18,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {75332#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {75332#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {75332#false} assume main_~node3__m3~1#1 != ~nomsg~0; {75332#false} is VALID [2022-02-20 18:44:18,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {75332#false} assume !(0 == ~alive3~0 % 256); {75332#false} is VALID [2022-02-20 18:44:18,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {75332#false} assume !(main_~node3__m3~1#1 > ~id3~0); {75332#false} is VALID [2022-02-20 18:44:18,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {75332#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {75332#false} is VALID [2022-02-20 18:44:18,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {75332#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {75332#false} is VALID [2022-02-20 18:44:18,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {75332#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6743~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6743~0;~__tmp_6555_0~0 := main_~main____CPAchecker_TMP_0~0#1; {75332#false} is VALID [2022-02-20 18:44:18,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {75332#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6555_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {75332#false} is VALID [2022-02-20 18:44:18,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {75332#false} assume 0 == main_~assert__arg~2#1 % 256; {75332#false} is VALID [2022-02-20 18:44:18,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {75332#false} assume !false; {75332#false} is VALID [2022-02-20 18:44:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:18,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:18,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132825509] [2022-02-20 18:44:18,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132825509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:18,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:18,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:18,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523173048] [2022-02-20 18:44:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:18,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:44:18,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:18,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:18,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:18,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:18,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:18,128 INFO L87 Difference]: Start difference. First operand 4387 states and 6400 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:30,712 INFO L93 Difference]: Finished difference Result 10511 states and 15319 transitions. [2022-02-20 18:44:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:44:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2022-02-20 18:44:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2022-02-20 18:44:30,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 547 transitions. [2022-02-20 18:44:31,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:32,782 INFO L225 Difference]: With dead ends: 10511 [2022-02-20 18:44:32,782 INFO L226 Difference]: Without dead ends: 6170 [2022-02-20 18:44:32,787 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:44:32,787 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 886 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:32,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 226 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states.