./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.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a630ae12d5f6fa3f8faf425527884a616bada52a1fbcc4f1f28adcf4c6e228 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:43:53,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:43:53,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:43:53,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:43:53,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:43:53,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:43:53,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:43:53,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:43:53,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:43:53,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:43:53,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:43:53,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:43:53,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:43:53,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:43:53,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:43:53,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:43:53,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:43:53,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:43:53,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:43:53,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:43:53,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:43:53,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:43:53,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:43:53,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:43:53,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:43:53,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:43:53,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:43:53,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:43:53,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:43:53,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:43:53,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:43:53,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:43:53,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:43:53,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:43:53,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:43:53,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:43:53,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:43:53,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:43:53,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:43:53,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:43:53,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:43:53,765 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:53,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:43:53,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:43:53,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:43:53,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:43:53,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:43:53,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:43:53,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:43:53,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:43:53,792 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:43:53,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:43:53,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:43:53,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:43:53,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:43:53,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:43:53,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:43:53,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:43:53,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:43:53,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:43:53,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:43:53,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:43:53,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:43:53,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:43:53,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:43:53,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:43:53,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:53,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:43:53,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:43:53,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:43:53,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:43:53,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:43:53,797 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:43:53,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:43:53,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:43:53,797 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 -> 43a630ae12d5f6fa3f8faf425527884a616bada52a1fbcc4f1f28adcf4c6e228 [2022-02-20 18:43:53,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:43:54,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:43:54,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:43:54,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:43:54,010 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:43:54,011 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.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:43:54,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94712cf17/18a82004bfa54369a7efabe572eaa09e/FLAG2bd0bb6f5 [2022-02-20 18:43:54,398 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:43:54,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:43:54,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94712cf17/18a82004bfa54369a7efabe572eaa09e/FLAG2bd0bb6f5 [2022-02-20 18:43:54,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94712cf17/18a82004bfa54369a7efabe572eaa09e [2022-02-20 18:43:54,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:43:54,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:43:54,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:54,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:43:54,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:43:54,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:54" (1/1) ... [2022-02-20 18:43:54,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194a909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:54, skipping insertion in model container [2022-02-20 18:43:54,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:54" (1/1) ... [2022-02-20 18:43:54,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:43:54,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:43:54,994 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.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2022-02-20 18:43:55,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:55,038 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:43:55,072 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.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2022-02-20 18:43:55,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:55,116 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:43:55,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:55 WrapperNode [2022-02-20 18:43:55,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:55,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:55,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:43:55,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:43:55,142 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:55" (1/1) ... [2022-02-20 18:43:55,154 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:55" (1/1) ... [2022-02-20 18:43:55,213 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 595 [2022-02-20 18:43:55,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:55,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:43:55,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:43:55,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:43:55,220 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:55" (1/1) ... [2022-02-20 18:43:55,220 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:55" (1/1) ... [2022-02-20 18:43:55,227 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:55" (1/1) ... [2022-02-20 18:43:55,230 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:55" (1/1) ... [2022-02-20 18:43:55,237 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:55" (1/1) ... [2022-02-20 18:43:55,253 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:55" (1/1) ... [2022-02-20 18:43:55,258 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:55" (1/1) ... [2022-02-20 18:43:55,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:43:55,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:43:55,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:43:55,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:43:55,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:55" (1/1) ... [2022-02-20 18:43:55,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:55,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:43:55,324 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:55,330 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:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:43:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:43:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:43:55,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:43:55,468 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:43:55,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:43:56,006 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:43:56,015 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:43:56,015 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:43:56,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:56 BoogieIcfgContainer [2022-02-20 18:43:56,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:43:56,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:43:56,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:43:56,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:43:56,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:43:54" (1/3) ... [2022-02-20 18:43:56,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcb2dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:56, skipping insertion in model container [2022-02-20 18:43:56,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:55" (2/3) ... [2022-02-20 18:43:56,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcb2dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:56, skipping insertion in model container [2022-02-20 18:43:56,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:56" (3/3) ... [2022-02-20 18:43:56,024 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:43:56,027 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:43:56,027 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:43:56,068 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:43:56,074 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:56,074 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:43:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call 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:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:43:56,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:56,107 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] [2022-02-20 18:43:56,107 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:56,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash 293786216, now seen corresponding path program 1 times [2022-02-20 18:43:56,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:56,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638951750] [2022-02-20 18:43:56,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:56,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {164#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {164#true} is VALID [2022-02-20 18:43:56,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#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_~__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_~__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_~__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;~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; {164#true} is VALID [2022-02-20 18:43:56,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume 0 == ~r1~0 % 256; {164#true} is VALID [2022-02-20 18:43:56,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {164#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {164#true} is VALID [2022-02-20 18:43:56,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {164#true} assume ~id1~0 >= 0; {164#true} is VALID [2022-02-20 18:43:56,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} assume 0 == ~st1~0; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:56,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:56,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:56,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(<= ~st1~0 0)} assume ~id2~0 >= 0; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:56,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(<= ~st1~0 0)} assume 0 == ~st2~0; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {168#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:56,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {165#false} is VALID [2022-02-20 18:43:56,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#false} 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; {165#false} is VALID [2022-02-20 18:43:56,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#false} assume 0 == main_~assert__arg~2#1 % 256; {165#false} is VALID [2022-02-20 18:43:56,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-02-20 18:43:56,421 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:56,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:56,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638951750] [2022-02-20 18:43:56,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638951750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:56,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:56,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:56,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748226658] [2022-02-20 18:43:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:43:56,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:56,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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:56,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:56,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:56,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:56,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:56,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:56,504 INFO L87 Difference]: Start difference. First operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 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 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:57,603 INFO L93 Difference]: Finished difference Result 516 states and 834 transitions. [2022-02-20 18:43:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:57,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:43:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2022-02-20 18:43:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2022-02-20 18:43:57,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 834 transitions. [2022-02-20 18:43:58,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 834 edges. 834 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:58,172 INFO L225 Difference]: With dead ends: 516 [2022-02-20 18:43:58,172 INFO L226 Difference]: Without dead ends: 437 [2022-02-20 18:43:58,174 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:58,176 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 908 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1286 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:58,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 1286 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:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-02-20 18:43:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 255. [2022-02-20 18:43:58,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:58,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 437 states. Second operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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,268 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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,269 INFO L87 Difference]: Start difference. First operand 437 states. Second operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,284 INFO L93 Difference]: Finished difference Result 437 states and 670 transitions. [2022-02-20 18:43:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 670 transitions. [2022-02-20 18:43:58,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:58,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:58,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 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 437 states. [2022-02-20 18:43:58,287 INFO L87 Difference]: Start difference. First operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 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 437 states. [2022-02-20 18:43:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,299 INFO L93 Difference]: Finished difference Result 437 states and 670 transitions. [2022-02-20 18:43:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 670 transitions. [2022-02-20 18:43:58,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:58,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:58,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:58,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2022-02-20 18:43:58,308 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 49 [2022-02-20 18:43:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:58,308 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2022-02-20 18:43:58,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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,308 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2022-02-20 18:43:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:43:58,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:58,309 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] [2022-02-20 18:43:58,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:43:58,310 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1697275801, now seen corresponding path program 1 times [2022-02-20 18:43:58,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:58,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253547075] [2022-02-20 18:43:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:58,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {2069#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {2069#true} is VALID [2022-02-20 18:43:58,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {2069#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_~__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_~__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_~__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;~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; {2069#true} is VALID [2022-02-20 18:43:58,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {2069#true} assume 0 == ~r1~0 % 256; {2069#true} is VALID [2022-02-20 18:43:58,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {2069#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {2069#true} is VALID [2022-02-20 18:43:58,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {2069#true} assume ~id1~0 >= 0; {2069#true} is VALID [2022-02-20 18:43:58,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2069#true} assume 0 == ~st1~0; {2069#true} is VALID [2022-02-20 18:43:58,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {2069#true} assume ~send1~0 == ~id1~0; {2069#true} is VALID [2022-02-20 18:43:58,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {2069#true} assume 0 == ~mode1~0 % 256; {2069#true} is VALID [2022-02-20 18:43:58,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {2069#true} assume ~id2~0 >= 0; {2069#true} is VALID [2022-02-20 18:43:58,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {2069#true} assume 0 == ~st2~0; {2069#true} is VALID [2022-02-20 18:43:58,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {2069#true} assume ~send2~0 == ~id2~0; {2069#true} is VALID [2022-02-20 18:43:58,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {2069#true} assume 0 == ~mode2~0 % 256; {2069#true} is VALID [2022-02-20 18:43:58,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {2069#true} assume ~id3~0 >= 0; {2069#true} is VALID [2022-02-20 18:43:58,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {2069#true} assume 0 == ~st3~0; {2069#true} is VALID [2022-02-20 18:43:58,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {2069#true} assume ~send3~0 == ~id3~0; {2069#true} is VALID [2022-02-20 18:43:58,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2069#true} assume 0 == ~mode3~0 % 256; {2069#true} is VALID [2022-02-20 18:43:58,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#true} assume ~id1~0 != ~id2~0; {2069#true} is VALID [2022-02-20 18:43:58,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {2069#true} assume ~id1~0 != ~id3~0; {2069#true} is VALID [2022-02-20 18:43:58,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {2069#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {2069#true} is VALID [2022-02-20 18:43:58,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {2069#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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2069#true} is VALID [2022-02-20 18:43:58,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {2069#true} assume !!(0 == ~mode1~0 % 256); {2069#true} is VALID [2022-02-20 18:43:58,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {2069#true} assume !!(0 == ~alive1~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {2071#(= (+ ~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; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~mode1~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:58,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {2070#false} is VALID [2022-02-20 18:43:58,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {2070#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2070#false} is VALID [2022-02-20 18:43:58,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {2070#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {2070#false} is VALID [2022-02-20 18:43:58,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {2070#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:43:58,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {2070#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:43:58,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {2070#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2070#false} is VALID [2022-02-20 18:43:58,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {2070#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:43:58,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {2070#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:43:58,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {2070#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2070#false} is VALID [2022-02-20 18:43:58,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {2070#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; {2070#false} is VALID [2022-02-20 18:43:58,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {2070#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {2070#false} is VALID [2022-02-20 18:43:58,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {2070#false} 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; {2070#false} is VALID [2022-02-20 18:43:58,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {2070#false} assume 0 == main_~assert__arg~2#1 % 256; {2070#false} is VALID [2022-02-20 18:43:58,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {2070#false} assume !false; {2070#false} is VALID [2022-02-20 18:43:58,404 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:58,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:58,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253547075] [2022-02-20 18:43:58,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253547075] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:58,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:58,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:58,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941905466] [2022-02-20 18:43:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:58,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:43:58,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:58,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:58,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:58,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:58,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:58,443 INFO L87 Difference]: Start difference. First operand 255 states and 385 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,811 INFO L93 Difference]: Finished difference Result 627 states and 965 transitions. [2022-02-20 18:43:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:58,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:43:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2022-02-20 18:43:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2022-02-20 18:43:58,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 552 transitions. [2022-02-20 18:43:59,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:59,142 INFO L225 Difference]: With dead ends: 627 [2022-02-20 18:43:59,142 INFO L226 Difference]: Without dead ends: 429 [2022-02-20 18:43:59,143 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:59,144 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 422 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:59,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 422 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:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-02-20 18:43:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2022-02-20 18:43:59,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:59,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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:59,283 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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:59,284 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:59,294 INFO L93 Difference]: Finished difference Result 429 states and 642 transitions. [2022-02-20 18:43:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 642 transitions. [2022-02-20 18:43:59,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:59,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:59,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 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 429 states. [2022-02-20 18:43:59,297 INFO L87 Difference]: Start difference. First operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 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 429 states. [2022-02-20 18:43:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:59,306 INFO L93 Difference]: Finished difference Result 429 states and 642 transitions. [2022-02-20 18:43:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 642 transitions. [2022-02-20 18:43:59,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:59,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:59,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:59,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 641 transitions. [2022-02-20 18:43:59,331 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 641 transitions. Word has length 52 [2022-02-20 18:43:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:59,333 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 641 transitions. [2022-02-20 18:43:59,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 641 transitions. [2022-02-20 18:43:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:43:59,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:59,335 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] [2022-02-20 18:43:59,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:43:59,335 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash -195371450, now seen corresponding path program 1 times [2022-02-20 18:43:59,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:59,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031783723] [2022-02-20 18:43:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:59,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {4324#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {4324#true} is VALID [2022-02-20 18:43:59,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {4324#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_~__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_~__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_~__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;~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; {4324#true} is VALID [2022-02-20 18:43:59,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {4324#true} assume 0 == ~r1~0 % 256; {4324#true} is VALID [2022-02-20 18:43:59,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {4324#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {4324#true} is VALID [2022-02-20 18:43:59,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {4324#true} assume ~id1~0 >= 0; {4324#true} is VALID [2022-02-20 18:43:59,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {4324#true} assume 0 == ~st1~0; {4324#true} is VALID [2022-02-20 18:43:59,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {4324#true} assume ~send1~0 == ~id1~0; {4324#true} is VALID [2022-02-20 18:43:59,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {4324#true} assume 0 == ~mode1~0 % 256; {4324#true} is VALID [2022-02-20 18:43:59,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {4324#true} assume ~id2~0 >= 0; {4324#true} is VALID [2022-02-20 18:43:59,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#true} assume 0 == ~st2~0; {4324#true} is VALID [2022-02-20 18:43:59,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {4324#true} assume ~send2~0 == ~id2~0; {4324#true} is VALID [2022-02-20 18:43:59,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {4324#true} assume 0 == ~mode2~0 % 256; {4324#true} is VALID [2022-02-20 18:43:59,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {4324#true} assume ~id3~0 >= 0; {4324#true} is VALID [2022-02-20 18:43:59,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {4324#true} assume 0 == ~st3~0; {4324#true} is VALID [2022-02-20 18:43:59,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#true} assume ~send3~0 == ~id3~0; {4324#true} is VALID [2022-02-20 18:43:59,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {4324#true} assume 0 == ~mode3~0 % 256; {4324#true} is VALID [2022-02-20 18:43:59,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {4324#true} assume ~id1~0 != ~id2~0; {4324#true} is VALID [2022-02-20 18:43:59,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {4324#true} assume ~id1~0 != ~id3~0; {4324#true} is VALID [2022-02-20 18:43:59,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {4324#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {4324#true} is VALID [2022-02-20 18:43:59,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {4324#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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4324#true} is VALID [2022-02-20 18:43:59,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {4324#true} assume !!(0 == ~mode1~0 % 256); {4324#true} is VALID [2022-02-20 18:43:59,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {4324#true} assume !!(0 == ~alive1~0 % 256); {4324#true} is VALID [2022-02-20 18:43:59,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {4324#true} assume !(~send1~0 != ~id1~0); {4324#true} is VALID [2022-02-20 18:43:59,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {4324#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4324#true} is VALID [2022-02-20 18:43:59,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {4324#true} assume !!(0 == ~mode2~0 % 256); {4324#true} is VALID [2022-02-20 18:43:59,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {4324#true} assume !!(0 == ~alive2~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~id3~0); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {4326#(= (+ (* (- 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; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode1~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {4326#(= (+ (* (- 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; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:59,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {4325#false} is VALID [2022-02-20 18:43:59,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {4325#false} assume !(main_~node2__m2~1#1 > ~id2~0); {4325#false} is VALID [2022-02-20 18:43:59,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {4325#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {4325#false} is VALID [2022-02-20 18:43:59,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {4325#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4325#false} is VALID [2022-02-20 18:43:59,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {4325#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4325#false} is VALID [2022-02-20 18:43:59,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {4325#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4325#false} is VALID [2022-02-20 18:43:59,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {4325#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; {4325#false} is VALID [2022-02-20 18:43:59,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {4325#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {4325#false} is VALID [2022-02-20 18:43:59,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {4325#false} 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; {4325#false} is VALID [2022-02-20 18:43:59,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {4325#false} assume 0 == main_~assert__arg~2#1 % 256; {4325#false} is VALID [2022-02-20 18:43:59,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {4325#false} assume !false; {4325#false} is VALID [2022-02-20 18:43:59,429 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:59,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:59,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031783723] [2022-02-20 18:43:59,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031783723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:59,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:59,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:59,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959861058] [2022-02-20 18:43:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:43:59,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:59,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:59,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:59,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:59,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:59,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:59,464 INFO L87 Difference]: Start difference. First operand 427 states and 641 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:59,959 INFO L93 Difference]: Finished difference Result 1077 states and 1638 transitions. [2022-02-20 18:43:59,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:59,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:43:59,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 18:43:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 18:43:59,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 546 transitions. [2022-02-20 18:44:00,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:00,301 INFO L225 Difference]: With dead ends: 1077 [2022-02-20 18:44:00,302 INFO L226 Difference]: Without dead ends: 749 [2022-02-20 18:44:00,303 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:44:00,304 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 159 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 436 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:44:00,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 436 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-02-20 18:44:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 747. [2022-02-20 18:44:00,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:00,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 749 states. Second operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,485 INFO L74 IsIncluded]: Start isIncluded. First operand 749 states. Second operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,486 INFO L87 Difference]: Start difference. First operand 749 states. Second operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:00,504 INFO L93 Difference]: Finished difference Result 749 states and 1116 transitions. [2022-02-20 18:44:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1116 transitions. [2022-02-20 18:44:00,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:00,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:00,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 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 749 states. [2022-02-20 18:44:00,508 INFO L87 Difference]: Start difference. First operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 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 749 states. [2022-02-20 18:44:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:00,534 INFO L93 Difference]: Finished difference Result 749 states and 1116 transitions. [2022-02-20 18:44:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1116 transitions. [2022-02-20 18:44:00,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:00,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:00,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:00,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1115 transitions. [2022-02-20 18:44:00,557 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1115 transitions. Word has length 52 [2022-02-20 18:44:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:00,558 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 1115 transitions. [2022-02-20 18:44:00,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,558 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1115 transitions. [2022-02-20 18:44:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:00,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:00,559 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] [2022-02-20 18:44:00,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:44:00,559 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1046972601, now seen corresponding path program 1 times [2022-02-20 18:44:00,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:00,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19721158] [2022-02-20 18:44:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:00,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {8257#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {8257#true} is VALID [2022-02-20 18:44:00,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {8257#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_~__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_~__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_~__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;~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; {8257#true} is VALID [2022-02-20 18:44:00,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {8257#true} assume 0 == ~r1~0 % 256; {8257#true} is VALID [2022-02-20 18:44:00,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {8257#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {8257#true} is VALID [2022-02-20 18:44:00,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {8257#true} assume ~id1~0 >= 0; {8257#true} is VALID [2022-02-20 18:44:00,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {8257#true} assume 0 == ~st1~0; {8257#true} is VALID [2022-02-20 18:44:00,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {8257#true} assume ~send1~0 == ~id1~0; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {8257#true} assume 0 == ~mode1~0 % 256; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {8257#true} assume ~id2~0 >= 0; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {8257#true} assume 0 == ~st2~0; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {8257#true} assume ~send2~0 == ~id2~0; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {8257#true} assume 0 == ~mode2~0 % 256; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {8257#true} assume ~id3~0 >= 0; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {8257#true} assume 0 == ~st3~0; {8257#true} is VALID [2022-02-20 18:44:00,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {8257#true} assume ~send3~0 == ~id3~0; {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {8257#true} assume 0 == ~mode3~0 % 256; {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {8257#true} assume ~id1~0 != ~id2~0; {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {8257#true} assume ~id1~0 != ~id3~0; {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {8257#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {8257#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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {8257#true} assume !!(0 == ~mode1~0 % 256); {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {8257#true} assume !!(0 == ~alive1~0 % 256); {8257#true} is VALID [2022-02-20 18:44:00,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {8257#true} assume !(~send1~0 != ~id1~0); {8257#true} is VALID [2022-02-20 18:44:00,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {8257#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8257#true} is VALID [2022-02-20 18:44:00,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {8257#true} assume !!(0 == ~mode2~0 % 256); {8257#true} is VALID [2022-02-20 18:44:00,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {8257#true} assume !!(0 == ~alive2~0 % 256); {8257#true} is VALID [2022-02-20 18:44:00,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {8257#true} assume !(~send2~0 != ~id2~0); {8257#true} is VALID [2022-02-20 18:44:00,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {8257#true} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8257#true} is VALID [2022-02-20 18:44:00,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {8257#true} assume !!(0 == ~mode3~0 % 256); {8257#true} is VALID [2022-02-20 18:44:00,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {8257#true} assume !!(0 == ~alive3~0 % 256); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {8259#(= (+ (* (- 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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode1~0 % 256); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {8259#(= (+ (* (- 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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {8259#(= (+ (* (- 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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:00,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {8258#false} is VALID [2022-02-20 18:44:00,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {8258#false} assume !(main_~node3__m3~1#1 > ~id3~0); {8258#false} is VALID [2022-02-20 18:44:00,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {8258#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {8258#false} is VALID [2022-02-20 18:44:00,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {8258#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; {8258#false} is VALID [2022-02-20 18:44:00,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {8258#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {8258#false} is VALID [2022-02-20 18:44:00,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {8258#false} 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; {8258#false} is VALID [2022-02-20 18:44:00,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {8258#false} assume 0 == main_~assert__arg~2#1 % 256; {8258#false} is VALID [2022-02-20 18:44:00,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {8258#false} assume !false; {8258#false} is VALID [2022-02-20 18:44:00,619 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:00,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:00,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19721158] [2022-02-20 18:44:00,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19721158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:00,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:00,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:00,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779286283] [2022-02-20 18:44:00,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:00,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:00,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:00,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:00,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:00,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:00,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:00,648 INFO L87 Difference]: Start difference. First operand 747 states and 1115 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:01,348 INFO L93 Difference]: Finished difference Result 1857 states and 2792 transitions. [2022-02-20 18:44:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-02-20 18:44:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-02-20 18:44:01,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 522 transitions. [2022-02-20 18:44:01,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:01,744 INFO L225 Difference]: With dead ends: 1857 [2022-02-20 18:44:01,745 INFO L226 Difference]: Without dead ends: 1293 [2022-02-20 18:44:01,746 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:44:01,746 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 146 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 436 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:44:01,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 436 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-02-20 18:44:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1291. [2022-02-20 18:44:02,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:02,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1293 states. Second operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,024 INFO L74 IsIncluded]: Start isIncluded. First operand 1293 states. Second operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,026 INFO L87 Difference]: Start difference. First operand 1293 states. Second operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:02,074 INFO L93 Difference]: Finished difference Result 1293 states and 1904 transitions. [2022-02-20 18:44:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1904 transitions. [2022-02-20 18:44:02,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:02,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:02,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 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 1293 states. [2022-02-20 18:44:02,088 INFO L87 Difference]: Start difference. First operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 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 1293 states. [2022-02-20 18:44:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:02,138 INFO L93 Difference]: Finished difference Result 1293 states and 1904 transitions. [2022-02-20 18:44:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1904 transitions. [2022-02-20 18:44:02,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:02,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:02,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:02,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1903 transitions. [2022-02-20 18:44:02,210 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1903 transitions. Word has length 52 [2022-02-20 18:44:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:02,210 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 1903 transitions. [2022-02-20 18:44:02,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call 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,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1903 transitions. [2022-02-20 18:44:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:02,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:02,212 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:44:02,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:44:02,212 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1633425885, now seen corresponding path program 1 times [2022-02-20 18:44:02,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:02,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547237541] [2022-02-20 18:44:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:02,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {15076#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {15076#true} is VALID [2022-02-20 18:44:02,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {15076#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_~__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_~__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_~__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;~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; {15076#true} is VALID [2022-02-20 18:44:02,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {15076#true} assume 0 == ~r1~0 % 256; {15076#true} is VALID [2022-02-20 18:44:02,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {15076#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {15076#true} is VALID [2022-02-20 18:44:02,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {15076#true} assume ~id1~0 >= 0; {15076#true} is VALID [2022-02-20 18:44:02,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {15076#true} assume 0 == ~st1~0; {15076#true} is VALID [2022-02-20 18:44:02,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {15076#true} assume ~send1~0 == ~id1~0; {15076#true} is VALID [2022-02-20 18:44:02,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {15076#true} assume 0 == ~mode1~0 % 256; {15076#true} is VALID [2022-02-20 18:44:02,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {15076#true} assume ~id2~0 >= 0; {15076#true} is VALID [2022-02-20 18:44:02,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {15076#true} assume 0 == ~st2~0; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:02,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {15078#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:02,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {15078#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:02,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {15078#(<= ~st2~0 0)} assume ~id3~0 >= 0; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:02,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {15078#(<= ~st2~0 0)} assume 0 == ~st3~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {15079#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {15079#(<= (+ ~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); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive2~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~id2~0); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive3~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~id3~0); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {15079#(<= (+ ~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; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:02,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:02,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {15080#(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_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {15077#false} is VALID [2022-02-20 18:44:02,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {15077#false} 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; {15077#false} is VALID [2022-02-20 18:44:02,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {15077#false} assume 0 == main_~assert__arg~2#1 % 256; {15077#false} is VALID [2022-02-20 18:44:02,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {15077#false} assume !false; {15077#false} is VALID [2022-02-20 18:44:02,305 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:02,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:02,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547237541] [2022-02-20 18:44:02,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547237541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:02,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:02,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:02,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724716807] [2022-02-20 18:44:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:02,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:02,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:02,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:02,335 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:44:02,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:02,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:02,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:02,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:02,336 INFO L87 Difference]: Start difference. First operand 1291 states and 1903 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:03,941 INFO L93 Difference]: Finished difference Result 2511 states and 3768 transitions. [2022-02-20 18:44:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:44:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:44:03,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 771 transitions. [2022-02-20 18:44:04,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:04,569 INFO L225 Difference]: With dead ends: 2511 [2022-02-20 18:44:04,569 INFO L226 Difference]: Without dead ends: 2145 [2022-02-20 18:44:04,570 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:04,571 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 643 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:04,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 1065 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2022-02-20 18:44:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1740. [2022-02-20 18:44:05,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:05,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2145 states. Second operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:05,470 INFO L74 IsIncluded]: Start isIncluded. First operand 2145 states. Second operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:05,473 INFO L87 Difference]: Start difference. First operand 2145 states. Second operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:05,597 INFO L93 Difference]: Finished difference Result 2145 states and 3195 transitions. [2022-02-20 18:44:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3195 transitions. [2022-02-20 18:44:05,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:05,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:05,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 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 2145 states. [2022-02-20 18:44:05,605 INFO L87 Difference]: Start difference. First operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 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 2145 states. [2022-02-20 18:44:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:05,730 INFO L93 Difference]: Finished difference Result 2145 states and 3195 transitions. [2022-02-20 18:44:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3195 transitions. [2022-02-20 18:44:05,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:05,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:05,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:05,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2580 transitions. [2022-02-20 18:44:05,855 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2580 transitions. Word has length 53 [2022-02-20 18:44:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:05,856 INFO L470 AbstractCegarLoop]: Abstraction has 1740 states and 2580 transitions. [2022-02-20 18:44:05,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2580 transitions. [2022-02-20 18:44:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:05,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:05,857 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:44:05,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:05,857 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1286312845, now seen corresponding path program 1 times [2022-02-20 18:44:05,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:05,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411693084] [2022-02-20 18:44:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:05,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:05,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {25153#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {25153#true} is VALID [2022-02-20 18:44:05,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {25153#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_~__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_~__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_~__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;~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; {25153#true} is VALID [2022-02-20 18:44:05,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {25153#true} assume 0 == ~r1~0 % 256; {25153#true} is VALID [2022-02-20 18:44:05,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {25153#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {25153#true} is VALID [2022-02-20 18:44:05,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {25153#true} assume ~id1~0 >= 0; {25153#true} is VALID [2022-02-20 18:44:05,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {25153#true} assume 0 == ~st1~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {25155#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {25155#(<= ~st1~0 0)} assume ~id2~0 >= 0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~st2~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {25155#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {25155#(<= ~st1~0 0)} assume ~id3~0 >= 0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:05,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~st3~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {25156#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {25156#(<= (+ ~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); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {25156#(<= (+ ~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; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:05,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:05,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {25157#(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; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:05,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {25157#(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; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:05,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:05,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {25157#(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; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:05,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {25157#(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_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {25154#false} is VALID [2022-02-20 18:44:05,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {25154#false} 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; {25154#false} is VALID [2022-02-20 18:44:05,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {25154#false} assume 0 == main_~assert__arg~2#1 % 256; {25154#false} is VALID [2022-02-20 18:44:05,932 INFO L290 TraceCheckUtils]: 52: Hoare triple {25154#false} assume !false; {25154#false} is VALID [2022-02-20 18:44:05,934 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:05,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:05,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411693084] [2022-02-20 18:44:05,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411693084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:05,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:05,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:05,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272239193] [2022-02-20 18:44:05,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:05,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:05,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:05,964 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:44:05,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:05,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:05,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:05,965 INFO L87 Difference]: Start difference. First operand 1740 states and 2580 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:08,035 INFO L93 Difference]: Finished difference Result 2960 states and 4445 transitions. [2022-02-20 18:44:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:44:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:44:08,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 771 transitions. [2022-02-20 18:44:08,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:08,724 INFO L225 Difference]: With dead ends: 2960 [2022-02-20 18:44:08,725 INFO L226 Difference]: Without dead ends: 2594 [2022-02-20 18:44:08,725 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:08,726 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 630 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:08,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1040 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-02-20 18:44:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2085. [2022-02-20 18:44:09,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:09,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2594 states. Second operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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:09,799 INFO L74 IsIncluded]: Start isIncluded. First operand 2594 states. Second operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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:09,817 INFO L87 Difference]: Start difference. First operand 2594 states. Second operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:09,990 INFO L93 Difference]: Finished difference Result 2594 states and 3872 transitions. [2022-02-20 18:44:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3872 transitions. [2022-02-20 18:44:09,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:09,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:09,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 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 2594 states. [2022-02-20 18:44:09,997 INFO L87 Difference]: Start difference. First operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 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 2594 states. [2022-02-20 18:44:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:10,172 INFO L93 Difference]: Finished difference Result 2594 states and 3872 transitions. [2022-02-20 18:44:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3872 transitions. [2022-02-20 18:44:10,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:10,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:10,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:10,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3103 transitions. [2022-02-20 18:44:10,335 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3103 transitions. Word has length 53 [2022-02-20 18:44:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:10,336 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 3103 transitions. [2022-02-20 18:44:10,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3103 transitions. [2022-02-20 18:44:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:10,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:10,337 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:44:10,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:10,337 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1015763425, now seen corresponding path program 1 times [2022-02-20 18:44:10,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:10,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342873480] [2022-02-20 18:44:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:10,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {37230#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {37230#true} is VALID [2022-02-20 18:44:10,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {37230#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_~__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_~__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_~__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;~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; {37230#true} is VALID [2022-02-20 18:44:10,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {37230#true} assume 0 == ~r1~0 % 256; {37230#true} is VALID [2022-02-20 18:44:10,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {37230#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {37230#true} is VALID [2022-02-20 18:44:10,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {37230#true} assume ~id1~0 >= 0; {37230#true} is VALID [2022-02-20 18:44:10,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {37230#true} assume 0 == ~st1~0; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:10,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {37232#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:10,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {37232#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:10,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {37232#(<= ~st1~0 0)} assume ~id2~0 >= 0; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:10,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {37232#(<= ~st1~0 0)} assume 0 == ~st2~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {37233#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {37233#(<= (+ ~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); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {37233#(<= (+ ~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; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:10,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {37234#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:44:10,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {37234#(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; {37234#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:44:10,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {37234#(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_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {37231#false} is VALID [2022-02-20 18:44:10,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {37231#false} 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; {37231#false} is VALID [2022-02-20 18:44:10,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {37231#false} assume 0 == main_~assert__arg~2#1 % 256; {37231#false} is VALID [2022-02-20 18:44:10,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {37231#false} assume !false; {37231#false} is VALID [2022-02-20 18:44:10,401 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:10,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:10,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342873480] [2022-02-20 18:44:10,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342873480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:10,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:10,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:10,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250753074] [2022-02-20 18:44:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:10,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:10,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:10,431 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:44:10,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:10,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:10,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:10,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:10,432 INFO L87 Difference]: Start difference. First operand 2085 states and 3103 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:12,883 INFO L93 Difference]: Finished difference Result 3359 states and 5045 transitions. [2022-02-20 18:44:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:44:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:44:12,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 771 transitions. [2022-02-20 18:44:13,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:13,633 INFO L225 Difference]: With dead ends: 3359 [2022-02-20 18:44:13,633 INFO L226 Difference]: Without dead ends: 2993 [2022-02-20 18:44:13,634 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:13,634 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 636 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1068 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:13,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 1068 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:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2022-02-20 18:44:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2375. [2022-02-20 18:44:14,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:14,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2993 states. Second operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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:14,805 INFO L74 IsIncluded]: Start isIncluded. First operand 2993 states. Second operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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:14,807 INFO L87 Difference]: Start difference. First operand 2993 states. Second operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:15,030 INFO L93 Difference]: Finished difference Result 2993 states and 4472 transitions. [2022-02-20 18:44:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4472 transitions. [2022-02-20 18:44:15,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:15,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:15,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 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 2993 states. [2022-02-20 18:44:15,036 INFO L87 Difference]: Start difference. First operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 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 2993 states. [2022-02-20 18:44:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:15,264 INFO L93 Difference]: Finished difference Result 2993 states and 4472 transitions. [2022-02-20 18:44:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4472 transitions. [2022-02-20 18:44:15,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:15,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:15,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:15,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3544 transitions. [2022-02-20 18:44:15,471 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3544 transitions. Word has length 53 [2022-02-20 18:44:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:15,472 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 3544 transitions. [2022-02-20 18:44:15,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:44:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3544 transitions. [2022-02-20 18:44:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:44:15,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:15,473 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] [2022-02-20 18:44:15,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:15,473 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:15,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1968890954, now seen corresponding path program 1 times [2022-02-20 18:44:15,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:15,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248224205] [2022-02-20 18:44:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:15,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {51062#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:15,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {51064#(<= (+ ~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_~__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_~__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_~__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;~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; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:15,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {51064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:15,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {51064#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:15,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {51064#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {51065#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:15,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {51065#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {51065#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:15,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {51065#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {51066#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {51063#false} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {51063#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); {51063#false} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {51063#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {51063#false} assume !!(0 == ~mode2~0 % 256); {51063#false} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {51063#false} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {51063#false} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {51063#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {51063#false} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {51063#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); {51063#false} is VALID [2022-02-20 18:44:15,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {51063#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {51063#false} assume !!(0 == ~mode3~0 % 256); {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {51063#false} assume !!(0 == ~alive3~0 % 256); {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {51063#false} assume !(~send3~0 != ~id3~0); {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {51063#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; {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {51063#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {51063#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {51063#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {51063#false} assume !(0 == ~mode1~0 % 256); {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {51063#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {51063#false} assume main_~node1__m1~1#1 != ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {51063#false} assume !(0 == ~alive1~0 % 256); {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {51063#false} assume !(main_~node1__m1~1#1 > ~id1~0); {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {51063#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {51063#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {51063#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {51063#false} assume main_~node2__m2~1#1 != ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {51063#false} assume !(0 == ~alive2~0 % 256); {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {51063#false} assume !(main_~node2__m2~1#1 > ~id2~0); {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {51063#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {51063#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {51063#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {51063#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {51063#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; {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {51063#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {51063#false} 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; {51063#false} is VALID [2022-02-20 18:44:15,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {51063#false} assume 0 == main_~assert__arg~2#1 % 256; {51063#false} is VALID [2022-02-20 18:44:15,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {51063#false} assume !false; {51063#false} is VALID [2022-02-20 18:44:15,531 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:15,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:15,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248224205] [2022-02-20 18:44:15,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248224205] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:15,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:15,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:15,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084240068] [2022-02-20 18:44:15,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:15,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:44:15,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:15,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:15,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:15,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:15,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:15,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:15,562 INFO L87 Difference]: Start difference. First operand 2375 states and 3544 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:21,603 INFO L93 Difference]: Finished difference Result 6743 states and 10099 transitions. [2022-02-20 18:44:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:21,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:44:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-02-20 18:44:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-02-20 18:44:21,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-02-20 18:44:21,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:22,736 INFO L225 Difference]: With dead ends: 6743 [2022-02-20 18:44:22,736 INFO L226 Difference]: Without dead ends: 4395 [2022-02-20 18:44:22,738 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:22,739 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 935 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:22,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [935 Valid, 220 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2022-02-20 18:44:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 4368. [2022-02-20 18:44:26,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:26,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4395 states. Second operand has 4368 states, 4367 states have (on average 1.4868330661781544) internal successors, (6493), 4367 states have internal predecessors, (6493), 0 states have call successors, (0), 0 states have call 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:26,626 INFO L74 IsIncluded]: Start isIncluded. First operand 4395 states. Second operand has 4368 states, 4367 states have (on average 1.4868330661781544) internal successors, (6493), 4367 states have internal predecessors, (6493), 0 states have call successors, (0), 0 states have call 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:26,629 INFO L87 Difference]: Start difference. First operand 4395 states. Second operand has 4368 states, 4367 states have (on average 1.4868330661781544) internal successors, (6493), 4367 states have internal predecessors, (6493), 0 states have call successors, (0), 0 states have call 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:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:27,158 INFO L93 Difference]: Finished difference Result 4395 states and 6519 transitions. [2022-02-20 18:44:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6519 transitions. [2022-02-20 18:44:27,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:27,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:27,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 4368 states, 4367 states have (on average 1.4868330661781544) internal successors, (6493), 4367 states have internal predecessors, (6493), 0 states have call successors, (0), 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 4395 states. [2022-02-20 18:44:27,170 INFO L87 Difference]: Start difference. First operand has 4368 states, 4367 states have (on average 1.4868330661781544) internal successors, (6493), 4367 states have internal predecessors, (6493), 0 states have call successors, (0), 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 4395 states. [2022-02-20 18:44:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:27,703 INFO L93 Difference]: Finished difference Result 4395 states and 6519 transitions. [2022-02-20 18:44:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6519 transitions. [2022-02-20 18:44:27,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:27,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:27,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:27,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4368 states, 4367 states have (on average 1.4868330661781544) internal successors, (6493), 4367 states have internal predecessors, (6493), 0 states have call successors, (0), 0 states have call 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:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 6493 transitions. [2022-02-20 18:44:28,448 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 6493 transitions. Word has length 57 [2022-02-20 18:44:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:28,449 INFO L470 AbstractCegarLoop]: Abstraction has 4368 states and 6493 transitions. [2022-02-20 18:44:28,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 6493 transitions. [2022-02-20 18:44:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:44:28,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:28,451 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] [2022-02-20 18:44:28,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:44:28,451 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash -108107112, now seen corresponding path program 1 times [2022-02-20 18:44:28,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:28,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557224747] [2022-02-20 18:44:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:28,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {75070#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {75072#(<= (+ ~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_~__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_~__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_~__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;~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; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {75072#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {75072#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {75072#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {75072#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {75072#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {75072#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {75072#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:28,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {75072#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {75073#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:28,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {75073#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {75073#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:28,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {75073#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {75074#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {75074#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:28,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {75074#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {75071#false} is VALID [2022-02-20 18:44:28,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {75071#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); {75071#false} is VALID [2022-02-20 18:44:28,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {75071#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {75071#false} assume !!(0 == ~mode3~0 % 256); {75071#false} is VALID [2022-02-20 18:44:28,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {75071#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {75071#false} is VALID [2022-02-20 18:44:28,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {75071#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {75071#false} is VALID [2022-02-20 18:44:28,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {75071#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); {75071#false} is VALID [2022-02-20 18:44:28,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {75071#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; {75071#false} is VALID [2022-02-20 18:44:28,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {75071#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {75071#false} is VALID [2022-02-20 18:44:28,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {75071#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {75071#false} is VALID [2022-02-20 18:44:28,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {75071#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {75071#false} assume !(0 == ~mode1~0 % 256); {75071#false} is VALID [2022-02-20 18:44:28,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {75071#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {75071#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {75071#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {75071#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {75071#false} assume main_~node2__m2~1#1 != ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {75071#false} assume !(0 == ~alive2~0 % 256); {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {75071#false} assume !(main_~node2__m2~1#1 > ~id2~0); {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {75071#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {75071#false} is VALID [2022-02-20 18:44:28,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {75071#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {75071#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {75071#false} assume main_~node3__m3~1#1 != ~nomsg~0; {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {75071#false} assume !(0 == ~alive3~0 % 256); {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {75071#false} assume !(main_~node3__m3~1#1 > ~id3~0); {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {75071#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {75071#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; {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {75071#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {75071#false} is VALID [2022-02-20 18:44:28,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {75071#false} 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; {75071#false} is VALID [2022-02-20 18:44:28,555 INFO L290 TraceCheckUtils]: 55: Hoare triple {75071#false} assume 0 == main_~assert__arg~2#1 % 256; {75071#false} is VALID [2022-02-20 18:44:28,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {75071#false} assume !false; {75071#false} is VALID [2022-02-20 18:44:28,555 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:28,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:28,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557224747] [2022-02-20 18:44:28,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557224747] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:28,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:28,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:28,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073921011] [2022-02-20 18:44:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:28,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:44:28,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:28,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:28,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:28,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:28,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:28,597 INFO L87 Difference]: Start difference. First operand 4368 states and 6493 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:40,201 INFO L93 Difference]: Finished difference Result 10465 states and 15544 transitions. [2022-02-20 18:44:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:40,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:44:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2022-02-20 18:44:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2022-02-20 18:44:40,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 552 transitions. [2022-02-20 18:44:40,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:41,961 INFO L225 Difference]: With dead ends: 10465 [2022-02-20 18:44:41,961 INFO L226 Difference]: Without dead ends: 6142 [2022-02-20 18:44:41,969 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:41,969 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 894 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:41,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 230 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2022-02-20 18:44:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 6108. [2022-02-20 18:44:48,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:48,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6142 states. Second operand has 6108 states, 6107 states have (on average 1.4735549369575895) internal successors, (8999), 6107 states have internal predecessors, (8999), 0 states have call successors, (0), 0 states have call 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:48,943 INFO L74 IsIncluded]: Start isIncluded. First operand 6142 states. Second operand has 6108 states, 6107 states have (on average 1.4735549369575895) internal successors, (8999), 6107 states have internal predecessors, (8999), 0 states have call successors, (0), 0 states have call 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:48,947 INFO L87 Difference]: Start difference. First operand 6142 states. Second operand has 6108 states, 6107 states have (on average 1.4735549369575895) internal successors, (8999), 6107 states have internal predecessors, (8999), 0 states have call successors, (0), 0 states have call 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:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:49,875 INFO L93 Difference]: Finished difference Result 6142 states and 9032 transitions. [2022-02-20 18:44:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 9032 transitions. [2022-02-20 18:44:49,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:49,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:49,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 6108 states, 6107 states have (on average 1.4735549369575895) internal successors, (8999), 6107 states have internal predecessors, (8999), 0 states have call successors, (0), 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 6142 states. [2022-02-20 18:44:49,890 INFO L87 Difference]: Start difference. First operand has 6108 states, 6107 states have (on average 1.4735549369575895) internal successors, (8999), 6107 states have internal predecessors, (8999), 0 states have call successors, (0), 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 6142 states. [2022-02-20 18:44:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:50,845 INFO L93 Difference]: Finished difference Result 6142 states and 9032 transitions. [2022-02-20 18:44:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 9032 transitions. [2022-02-20 18:44:50,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:50,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:50,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:50,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6108 states, 6107 states have (on average 1.4735549369575895) internal successors, (8999), 6107 states have internal predecessors, (8999), 0 states have call successors, (0), 0 states have call 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:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8999 transitions. [2022-02-20 18:44:52,270 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8999 transitions. Word has length 57 [2022-02-20 18:44:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:52,270 INFO L470 AbstractCegarLoop]: Abstraction has 6108 states and 8999 transitions. [2022-02-20 18:44:52,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call 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:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8999 transitions. [2022-02-20 18:44:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:44:52,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:52,271 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:52,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:44:52,272 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash 871846780, now seen corresponding path program 1 times [2022-02-20 18:44:52,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:52,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523619038] [2022-02-20 18:44:52,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:52,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:52,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {110176#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_6348~0 := 0;~__return_6426~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6744~0 := 0; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {110178#(<= (+ ~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_~__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_~__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_~__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;~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; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {110178#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:52,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {110178#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {110179#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:52,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {110179#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {110179#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:52,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {110179#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {110180#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:52,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {110180#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {110177#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); {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {110177#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; {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {110177#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {110177#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6426~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6426~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; {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {110177#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {110177#false} assume !(0 == ~mode1~0 % 256); {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {110177#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {110177#false} assume main_~node1__m1~1#1 != ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {110177#false} assume !(0 == ~alive1~0 % 256); {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {110177#false} assume !(main_~node1__m1~1#1 > ~id1~0); {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {110177#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {110177#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {110177#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {110177#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {110177#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {110177#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {110177#false} assume main_~node3__m3~1#1 != ~nomsg~0; {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {110177#false} assume !(0 == ~alive3~0 % 256); {110177#false} is VALID [2022-02-20 18:44:52,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {110177#false} assume !(main_~node3__m3~1#1 > ~id3~0); {110177#false} is VALID [2022-02-20 18:44:52,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {110177#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {110177#false} is VALID [2022-02-20 18:44:52,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {110177#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; {110177#false} is VALID [2022-02-20 18:44:52,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {110177#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6744~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6744~0; {110177#false} is VALID [2022-02-20 18:44:52,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {110177#false} 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; {110177#false} is VALID [2022-02-20 18:44:52,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {110177#false} assume 0 == main_~assert__arg~2#1 % 256; {110177#false} is VALID [2022-02-20 18:44:52,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {110177#false} assume !false; {110177#false} is VALID [2022-02-20 18:44:52,330 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:52,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:52,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523619038] [2022-02-20 18:44:52,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523619038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:52,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:52,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:52,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008221664] [2022-02-20 18:44:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:52,331 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:52,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:52,332 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:52,362 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:52,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:52,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:52,363 INFO L87 Difference]: Start difference. First operand 6108 states and 8999 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)