./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-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 3da1085986a33686aa7ffc74caa759bc9bd987d241f97554ff5ad69a436a7e40 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:43:26,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:43:26,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:43:26,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:43:26,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:43:26,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:43:26,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:43:26,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:43:26,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:43:26,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:43:26,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:43:26,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:43:26,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:43:26,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:43:26,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:43:26,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:43:26,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:43:26,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:43:26,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:43:26,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:43:26,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:43:26,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:43:26,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:43:26,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:43:27,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:43:27,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:43:27,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:43:27,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:43:27,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:43:27,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:43:27,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:43:27,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:43:27,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:43:27,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:43:27,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:43:27,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:43:27,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:43:27,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:43:27,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:43:27,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:43:27,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:43:27,011 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:27,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:43:27,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:43:27,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:43:27,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:43:27,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:43:27,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:43:27,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:43:27,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:43:27,052 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:43:27,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:43:27,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:43:27,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:43:27,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:43:27,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:43:27,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:43:27,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:43:27,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:43:27,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:43:27,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:43:27,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:43:27,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:43:27,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:43:27,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:43:27,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:43:27,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:27,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:43:27,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:43:27,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:43:27,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:43:27,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:43:27,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:43:27,058 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:43:27,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:43:27,059 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 -> 3da1085986a33686aa7ffc74caa759bc9bd987d241f97554ff5ad69a436a7e40 [2022-02-20 18:43:27,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:43:27,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:43:27,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:43:27,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:43:27,296 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:43:27,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:43:27,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc8a4f1a/f75b02c4555c41e09880c34a7c754b74/FLAG26beba898 [2022-02-20 18:43:27,799 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:43:27,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:43:27,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc8a4f1a/f75b02c4555c41e09880c34a7c754b74/FLAG26beba898 [2022-02-20 18:43:27,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc8a4f1a/f75b02c4555c41e09880c34a7c754b74 [2022-02-20 18:43:27,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:43:27,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:43:27,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:27,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:43:27,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:43:27,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:27" (1/1) ... [2022-02-20 18:43:27,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43795c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:27, skipping insertion in model container [2022-02-20 18:43:27,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:27" (1/1) ... [2022-02-20 18:43:27,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:43:27,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:43:28,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2022-02-20 18:43:28,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:28,089 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:43:28,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2022-02-20 18:43:28,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:28,174 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:43:28,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:28 WrapperNode [2022-02-20 18:43:28,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:28,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:28,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:43:28,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:43:28,183 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:28" (1/1) ... [2022-02-20 18:43:28,201 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:28" (1/1) ... [2022-02-20 18:43:28,237 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 333 [2022-02-20 18:43:28,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:28,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:43:28,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:43:28,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:43:28,254 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:28" (1/1) ... [2022-02-20 18:43:28,254 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:28" (1/1) ... [2022-02-20 18:43:28,257 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:28" (1/1) ... [2022-02-20 18:43:28,266 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:28" (1/1) ... [2022-02-20 18:43:28,273 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:28" (1/1) ... [2022-02-20 18:43:28,290 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:28" (1/1) ... [2022-02-20 18:43:28,292 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:28" (1/1) ... [2022-02-20 18:43:28,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:43:28,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:43:28,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:43:28,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:43:28,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:28" (1/1) ... [2022-02-20 18:43:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:28,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:43:28,325 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:28,327 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:28,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:43:28,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:43:28,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:43:28,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:43:28,454 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:43:28,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:43:28,847 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:43:28,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:43:28,854 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:43:28,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:28 BoogieIcfgContainer [2022-02-20 18:43:28,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:43:28,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:43:28,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:43:28,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:43:28,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:43:27" (1/3) ... [2022-02-20 18:43:28,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bca9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:28, skipping insertion in model container [2022-02-20 18:43:28,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:28" (2/3) ... [2022-02-20 18:43:28,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bca9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:28, skipping insertion in model container [2022-02-20 18:43:28,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:28" (3/3) ... [2022-02-20 18:43:28,863 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:43:28,868 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:43:28,868 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:43:28,921 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:43:28,926 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:28,926 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:43:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call 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:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:43:28,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:28,947 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] [2022-02-20 18:43:28,948 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1258202004, now seen corresponding path program 1 times [2022-02-20 18:43:28,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:28,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532698091] [2022-02-20 18:43:28,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:29,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {88#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {88#true} is VALID [2022-02-20 18:43:29,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {88#true} is VALID [2022-02-20 18:43:29,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#true} assume 0 == ~r1~0; {88#true} is VALID [2022-02-20 18:43:29,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {88#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {88#true} is VALID [2022-02-20 18:43:29,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#true} assume ~id1~0 >= 0; {88#true} is VALID [2022-02-20 18:43:29,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#true} assume 0 == ~st1~0; {88#true} is VALID [2022-02-20 18:43:29,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {88#true} assume ~send1~0 == ~id1~0; {88#true} is VALID [2022-02-20 18:43:29,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {88#true} assume 0 == ~mode1~0 % 256; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:29,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {90#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {89#false} is VALID [2022-02-20 18:43:29,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {89#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {89#false} is VALID [2022-02-20 18:43:29,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {89#false} ~mode1~0 := 0; {89#false} is VALID [2022-02-20 18:43:29,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {89#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {89#false} is VALID [2022-02-20 18:43:29,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {89#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {89#false} is VALID [2022-02-20 18:43:29,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {89#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {89#false} is VALID [2022-02-20 18:43:29,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {89#false} ~mode2~0 := 0; {89#false} is VALID [2022-02-20 18:43:29,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {89#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {89#false} is VALID [2022-02-20 18:43:29,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {89#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {89#false} is VALID [2022-02-20 18:43:29,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {89#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {89#false} is VALID [2022-02-20 18:43:29,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {89#false} ~mode3~0 := 0; {89#false} is VALID [2022-02-20 18:43:29,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {89#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {89#false} is VALID [2022-02-20 18:43:29,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {89#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {89#false} is VALID [2022-02-20 18:43:29,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {89#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {89#false} is VALID [2022-02-20 18:43:29,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {89#false} assume 0 == main_~assert__arg~0#1 % 256; {89#false} is VALID [2022-02-20 18:43:29,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {89#false} assume !false; {89#false} is VALID [2022-02-20 18:43:29,363 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:29,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:29,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532698091] [2022-02-20 18:43:29,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532698091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:29,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:29,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:29,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316752217] [2022-02-20 18:43:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:29,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:43:29,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:29,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call 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:29,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:29,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:29,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:29,448 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 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 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call 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:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:29,794 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2022-02-20 18:43:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:29,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:43:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call 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:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-02-20 18:43:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call 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:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-02-20 18:43:29,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 318 transitions. [2022-02-20 18:43:30,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:30,182 INFO L225 Difference]: With dead ends: 199 [2022-02-20 18:43:30,183 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 18:43:30,186 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:30,192 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 101 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:30,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 300 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 18:43:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-02-20 18:43:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:30,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:30,236 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:30,238 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:30,250 INFO L93 Difference]: Finished difference Result 128 states and 189 transitions. [2022-02-20 18:43:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2022-02-20 18:43:30,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:30,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:30,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 0 states have call successors, (0), 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 128 states. [2022-02-20 18:43:30,254 INFO L87 Difference]: Start difference. First operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 0 states have call successors, (0), 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 128 states. [2022-02-20 18:43:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:30,260 INFO L93 Difference]: Finished difference Result 128 states and 189 transitions. [2022-02-20 18:43:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2022-02-20 18:43:30,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:30,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:30,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:30,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2022-02-20 18:43:30,268 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 37 [2022-02-20 18:43:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:30,269 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2022-02-20 18:43:30,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call 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:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2022-02-20 18:43:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:43:30,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:30,274 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] [2022-02-20 18:43:30,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:43:30,274 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:30,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:30,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2004783502, now seen corresponding path program 1 times [2022-02-20 18:43:30,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:30,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462242987] [2022-02-20 18:43:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:30,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:30,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {780#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {780#true} is VALID [2022-02-20 18:43:30,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {780#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {780#true} is VALID [2022-02-20 18:43:30,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {780#true} assume 0 == ~r1~0; {780#true} is VALID [2022-02-20 18:43:30,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {780#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {780#true} is VALID [2022-02-20 18:43:30,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {780#true} assume ~id1~0 >= 0; {780#true} is VALID [2022-02-20 18:43:30,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {780#true} assume 0 == ~st1~0; {780#true} is VALID [2022-02-20 18:43:30,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#true} assume ~send1~0 == ~id1~0; {780#true} is VALID [2022-02-20 18:43:30,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#true} assume 0 == ~mode1~0 % 256; {780#true} is VALID [2022-02-20 18:43:30,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#true} assume ~id2~0 >= 0; {780#true} is VALID [2022-02-20 18:43:30,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {780#true} assume 0 == ~st2~0; {780#true} is VALID [2022-02-20 18:43:30,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {780#true} assume ~send2~0 == ~id2~0; {780#true} is VALID [2022-02-20 18:43:30,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {780#true} assume 0 == ~mode2~0 % 256; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:30,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {782#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {781#false} is VALID [2022-02-20 18:43:30,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {781#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {781#false} is VALID [2022-02-20 18:43:30,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {781#false} ~mode2~0 := 0; {781#false} is VALID [2022-02-20 18:43:30,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {781#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {781#false} is VALID [2022-02-20 18:43:30,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {781#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {781#false} is VALID [2022-02-20 18:43:30,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {781#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {781#false} is VALID [2022-02-20 18:43:30,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {781#false} ~mode3~0 := 0; {781#false} is VALID [2022-02-20 18:43:30,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {781#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {781#false} is VALID [2022-02-20 18:43:30,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {781#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {781#false} is VALID [2022-02-20 18:43:30,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {781#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {781#false} is VALID [2022-02-20 18:43:30,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {781#false} assume 0 == main_~assert__arg~0#1 % 256; {781#false} is VALID [2022-02-20 18:43:30,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {781#false} assume !false; {781#false} is VALID [2022-02-20 18:43:30,370 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:30,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:30,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462242987] [2022-02-20 18:43:30,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462242987] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:30,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:30,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:30,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425350157] [2022-02-20 18:43:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:43:30,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:30,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call 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:30,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:30,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:30,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:30,417 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call 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:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:30,622 INFO L93 Difference]: Finished difference Result 306 states and 472 transitions. [2022-02-20 18:43:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:43:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call 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:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2022-02-20 18:43:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call 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:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2022-02-20 18:43:30,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 288 transitions. [2022-02-20 18:43:30,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:30,865 INFO L225 Difference]: With dead ends: 306 [2022-02-20 18:43:30,865 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 18:43:30,866 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:30,870 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 81 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:30,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 18:43:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2022-02-20 18:43:30,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:30,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call 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:30,892 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call 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:30,892 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call 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:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:30,899 INFO L93 Difference]: Finished difference Result 200 states and 302 transitions. [2022-02-20 18:43:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 302 transitions. [2022-02-20 18:43:30,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:30,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:30,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:43:30,902 INFO L87 Difference]: Start difference. First operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 0 states have call successors, (0), 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 200 states. [2022-02-20 18:43:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:30,909 INFO L93 Difference]: Finished difference Result 200 states and 302 transitions. [2022-02-20 18:43:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 302 transitions. [2022-02-20 18:43:30,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:30,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:30,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:30,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call 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:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 301 transitions. [2022-02-20 18:43:30,918 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 301 transitions. Word has length 38 [2022-02-20 18:43:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:30,919 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 301 transitions. [2022-02-20 18:43:30,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call 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:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 301 transitions. [2022-02-20 18:43:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:43:30,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:30,920 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] [2022-02-20 18:43:30,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:43:30,921 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash 337157617, now seen corresponding path program 1 times [2022-02-20 18:43:30,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:30,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094017437] [2022-02-20 18:43:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:30,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:30,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {1865#true} is VALID [2022-02-20 18:43:30,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {1865#true} is VALID [2022-02-20 18:43:30,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} assume 0 == ~r1~0; {1865#true} is VALID [2022-02-20 18:43:30,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1865#true} is VALID [2022-02-20 18:43:30,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {1865#true} assume ~id1~0 >= 0; {1865#true} is VALID [2022-02-20 18:43:30,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} assume 0 == ~st1~0; {1865#true} is VALID [2022-02-20 18:43:30,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} assume ~send1~0 == ~id1~0; {1865#true} is VALID [2022-02-20 18:43:30,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} assume 0 == ~mode1~0 % 256; {1865#true} is VALID [2022-02-20 18:43:30,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {1865#true} assume ~id2~0 >= 0; {1865#true} is VALID [2022-02-20 18:43:30,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {1865#true} assume 0 == ~st2~0; {1865#true} is VALID [2022-02-20 18:43:30,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1865#true} assume ~send2~0 == ~id2~0; {1865#true} is VALID [2022-02-20 18:43:30,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1865#true} assume 0 == ~mode2~0 % 256; {1865#true} is VALID [2022-02-20 18:43:30,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1865#true} assume ~id3~0 >= 0; {1865#true} is VALID [2022-02-20 18:43:30,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {1865#true} assume 0 == ~st3~0; {1865#true} is VALID [2022-02-20 18:43:30,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {1865#true} assume ~send3~0 == ~id3~0; {1865#true} is VALID [2022-02-20 18:43:30,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1865#true} assume 0 == ~mode3~0 % 256; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:30,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:31,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:31,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {1867#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1866#false} is VALID [2022-02-20 18:43:31,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {1866#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1866#false} is VALID [2022-02-20 18:43:31,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {1866#false} ~mode3~0 := 0; {1866#false} is VALID [2022-02-20 18:43:31,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {1866#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1866#false} is VALID [2022-02-20 18:43:31,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {1866#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1866#false} is VALID [2022-02-20 18:43:31,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {1866#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {1866#false} is VALID [2022-02-20 18:43:31,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {1866#false} assume 0 == main_~assert__arg~0#1 % 256; {1866#false} is VALID [2022-02-20 18:43:31,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {1866#false} assume !false; {1866#false} is VALID [2022-02-20 18:43:31,003 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:31,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:31,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094017437] [2022-02-20 18:43:31,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094017437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:31,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:31,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:31,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613994600] [2022-02-20 18:43:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:31,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:43:31,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:31,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:31,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:31,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:31,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:31,033 INFO L87 Difference]: Start difference. First operand 198 states and 301 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:31,235 INFO L93 Difference]: Finished difference Result 490 states and 759 transitions. [2022-02-20 18:43:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:31,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:43:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2022-02-20 18:43:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2022-02-20 18:43:31,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 288 transitions. [2022-02-20 18:43:31,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:31,482 INFO L225 Difference]: With dead ends: 490 [2022-02-20 18:43:31,483 INFO L226 Difference]: Without dead ends: 312 [2022-02-20 18:43:31,484 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:31,485 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:31,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-02-20 18:43:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2022-02-20 18:43:31,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:31,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call 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:31,509 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call 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:31,510 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call 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:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:31,519 INFO L93 Difference]: Finished difference Result 312 states and 474 transitions. [2022-02-20 18:43:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2022-02-20 18:43:31,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:31,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:31,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 0 states have call successors, (0), 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 312 states. [2022-02-20 18:43:31,522 INFO L87 Difference]: Start difference. First operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 0 states have call successors, (0), 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 312 states. [2022-02-20 18:43:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:31,532 INFO L93 Difference]: Finished difference Result 312 states and 474 transitions. [2022-02-20 18:43:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2022-02-20 18:43:31,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:31,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:31,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:31,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call 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:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 473 transitions. [2022-02-20 18:43:31,544 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 473 transitions. Word has length 39 [2022-02-20 18:43:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:31,544 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 473 transitions. [2022-02-20 18:43:31,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 473 transitions. [2022-02-20 18:43:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:43:31,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:31,546 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] [2022-02-20 18:43:31,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:43:31,546 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:31,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1621587317, now seen corresponding path program 1 times [2022-02-20 18:43:31,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:31,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178908691] [2022-02-20 18:43:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:31,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {3586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {3586#true} is VALID [2022-02-20 18:43:31,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {3586#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {3586#true} is VALID [2022-02-20 18:43:31,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {3586#true} assume 0 == ~r1~0; {3586#true} is VALID [2022-02-20 18:43:31,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {3586#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {3586#true} is VALID [2022-02-20 18:43:31,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {3586#true} assume ~id1~0 >= 0; {3586#true} is VALID [2022-02-20 18:43:31,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3586#true} assume 0 == ~st1~0; {3588#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:31,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {3588#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3588#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:31,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3588#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3588#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:31,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3588#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3588#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:31,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {3588#(<= ~st1~0 0)} assume 0 == ~st2~0; {3589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {3589#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {3589#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {3589#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {3589#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {3590#(<= (+ ~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; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:31,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {3590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3587#false} is VALID [2022-02-20 18:43:31,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {3587#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {3587#false} is VALID [2022-02-20 18:43:31,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {3587#false} assume 0 == main_~assert__arg~0#1 % 256; {3587#false} is VALID [2022-02-20 18:43:31,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {3587#false} assume !false; {3587#false} is VALID [2022-02-20 18:43:31,674 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:31,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:31,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178908691] [2022-02-20 18:43:31,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178908691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:31,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:31,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:31,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45710022] [2022-02-20 18:43:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:31,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:43:31,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:31,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:31,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:31,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:31,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:31,704 INFO L87 Difference]: Start difference. First operand 310 states and 473 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:32,833 INFO L93 Difference]: Finished difference Result 1470 states and 2285 transitions. [2022-02-20 18:43:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:43:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-02-20 18:43:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-02-20 18:43:32,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 510 transitions. [2022-02-20 18:43:33,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:33,271 INFO L225 Difference]: With dead ends: 1470 [2022-02-20 18:43:33,271 INFO L226 Difference]: Without dead ends: 1180 [2022-02-20 18:43:33,272 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:33,275 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 486 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:33,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 660 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-02-20 18:43:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 598. [2022-02-20 18:43:33,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:33,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1180 states. Second operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call 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:33,617 INFO L74 IsIncluded]: Start isIncluded. First operand 1180 states. Second operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call 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:33,619 INFO L87 Difference]: Start difference. First operand 1180 states. Second operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call 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:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:33,691 INFO L93 Difference]: Finished difference Result 1180 states and 1816 transitions. [2022-02-20 18:43:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1816 transitions. [2022-02-20 18:43:33,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:33,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:33,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 0 states have call successors, (0), 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 1180 states. [2022-02-20 18:43:33,696 INFO L87 Difference]: Start difference. First operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 0 states have call successors, (0), 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 1180 states. [2022-02-20 18:43:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:33,762 INFO L93 Difference]: Finished difference Result 1180 states and 1816 transitions. [2022-02-20 18:43:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1816 transitions. [2022-02-20 18:43:33,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:33,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:33,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:33,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call 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:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 909 transitions. [2022-02-20 18:43:33,789 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 909 transitions. Word has length 40 [2022-02-20 18:43:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:33,789 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 909 transitions. [2022-02-20 18:43:33,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 909 transitions. [2022-02-20 18:43:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:43:33,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:33,790 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] [2022-02-20 18:43:33,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:43:33,791 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1289857042, now seen corresponding path program 1 times [2022-02-20 18:43:33,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:33,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417020355] [2022-02-20 18:43:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:33,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {8810#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {8810#true} is VALID [2022-02-20 18:43:33,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {8810#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {8810#true} is VALID [2022-02-20 18:43:33,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {8810#true} assume 0 == ~r1~0; {8810#true} is VALID [2022-02-20 18:43:33,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {8810#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:43:33,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {8812#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:33,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:33,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:33,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:33,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:33,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {8813#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:33,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(~send2~0 != ~id2~0); {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:33,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} ~mode2~0 := 1; {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:33,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:33,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~mode3~0 % 256); {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:33,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {8814#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~alive3~0 % 256); {8811#false} is VALID [2022-02-20 18:43:33,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {8811#false} assume !(~send3~0 != ~id3~0); {8811#false} is VALID [2022-02-20 18:43:33,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {8811#false} ~mode3~0 := 1; {8811#false} is VALID [2022-02-20 18:43:33,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {8811#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8811#false} is VALID [2022-02-20 18:43:33,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {8811#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8811#false} is VALID [2022-02-20 18:43:33,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {8811#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {8811#false} is VALID [2022-02-20 18:43:33,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {8811#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {8811#false} is VALID [2022-02-20 18:43:33,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {8811#false} assume 0 == main_~assert__arg~0#1 % 256; {8811#false} is VALID [2022-02-20 18:43:33,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {8811#false} assume !false; {8811#false} is VALID [2022-02-20 18:43:33,907 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:33,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:33,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417020355] [2022-02-20 18:43:33,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417020355] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:33,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:33,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:33,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940758779] [2022-02-20 18:43:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:43:33,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:33,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call 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:33,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:33,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:33,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:33,952 INFO L87 Difference]: Start difference. First operand 598 states and 909 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call 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:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:35,775 INFO L93 Difference]: Finished difference Result 2068 states and 3144 transitions. [2022-02-20 18:43:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:43:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call 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:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 358 transitions. [2022-02-20 18:43:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call 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:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 358 transitions. [2022-02-20 18:43:35,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 358 transitions. [2022-02-20 18:43:36,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:36,185 INFO L225 Difference]: With dead ends: 2068 [2022-02-20 18:43:36,186 INFO L226 Difference]: Without dead ends: 1490 [2022-02-20 18:43:36,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:36,187 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 338 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:36,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 330 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-02-20 18:43:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1486. [2022-02-20 18:43:37,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:37,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1490 states. Second operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call 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:37,278 INFO L74 IsIncluded]: Start isIncluded. First operand 1490 states. Second operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call 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:37,280 INFO L87 Difference]: Start difference. First operand 1490 states. Second operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call 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:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:37,373 INFO L93 Difference]: Finished difference Result 1490 states and 2239 transitions. [2022-02-20 18:43:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2239 transitions. [2022-02-20 18:43:37,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:37,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:37,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 0 states have call successors, (0), 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 1490 states. [2022-02-20 18:43:37,383 INFO L87 Difference]: Start difference. First operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 0 states have call successors, (0), 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 1490 states. [2022-02-20 18:43:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:37,477 INFO L93 Difference]: Finished difference Result 1490 states and 2239 transitions. [2022-02-20 18:43:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2239 transitions. [2022-02-20 18:43:37,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:37,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:37,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:37,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call 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:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2237 transitions. [2022-02-20 18:43:37,611 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2237 transitions. Word has length 41 [2022-02-20 18:43:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:37,611 INFO L470 AbstractCegarLoop]: Abstraction has 1486 states and 2237 transitions. [2022-02-20 18:43:37,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call 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:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2237 transitions. [2022-02-20 18:43:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:43:37,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:37,613 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] [2022-02-20 18:43:37,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:43:37,613 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash 97793413, now seen corresponding path program 1 times [2022-02-20 18:43:37,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:37,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827391835] [2022-02-20 18:43:37,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:37,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:37,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {16727#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {16729#(<= (+ ~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {16729#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {16729#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {16729#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {16729#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {16729#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {16729#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {16729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:37,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {16729#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {16730#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:43:37,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {16730#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {16730#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:43:37,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {16730#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {16731#(<= (+ ~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; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16731#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:43:37,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {16731#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {16728#false} is VALID [2022-02-20 18:43:37,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {16728#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {16728#false} is VALID [2022-02-20 18:43:37,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {16728#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); {16728#false} is VALID [2022-02-20 18:43:37,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {16728#false} ~mode2~0 := 1; {16728#false} is VALID [2022-02-20 18:43:37,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {16728#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {16728#false} is VALID [2022-02-20 18:43:37,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {16728#false} assume !!(0 == ~mode3~0 % 256); {16728#false} is VALID [2022-02-20 18:43:37,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {16728#false} assume !!(0 == ~alive3~0 % 256); {16728#false} is VALID [2022-02-20 18:43:37,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {16728#false} assume !(~send3~0 != ~id3~0); {16728#false} is VALID [2022-02-20 18:43:37,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {16728#false} ~mode3~0 := 1; {16728#false} is VALID [2022-02-20 18:43:37,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {16728#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16728#false} is VALID [2022-02-20 18:43:37,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {16728#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16728#false} is VALID [2022-02-20 18:43:37,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {16728#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {16728#false} is VALID [2022-02-20 18:43:37,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {16728#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {16728#false} is VALID [2022-02-20 18:43:37,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {16728#false} assume 0 == main_~assert__arg~0#1 % 256; {16728#false} is VALID [2022-02-20 18:43:37,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {16728#false} assume !false; {16728#false} is VALID [2022-02-20 18:43:37,720 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:37,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:37,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827391835] [2022-02-20 18:43:37,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827391835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:37,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:37,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:43:37,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113397617] [2022-02-20 18:43:37,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:43:37,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:37,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:37,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:37,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:37,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:37,755 INFO L87 Difference]: Start difference. First operand 1486 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:42,242 INFO L93 Difference]: Finished difference Result 4418 states and 6671 transitions. [2022-02-20 18:43:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:42,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:43:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:43:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:43:42,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 314 transitions. [2022-02-20 18:43:42,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:42,868 INFO L225 Difference]: With dead ends: 4418 [2022-02-20 18:43:42,868 INFO L226 Difference]: Without dead ends: 2952 [2022-02-20 18:43:42,869 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:43:42,870 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 494 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:42,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 139 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:43:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2022-02-20 18:43:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 2950. [2022-02-20 18:43:46,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:46,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2952 states. Second operand has 2950 states, 2949 states have (on average 1.4991522550016956) internal successors, (4421), 2949 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,138 INFO L74 IsIncluded]: Start isIncluded. First operand 2952 states. Second operand has 2950 states, 2949 states have (on average 1.4991522550016956) internal successors, (4421), 2949 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,143 INFO L87 Difference]: Start difference. First operand 2952 states. Second operand has 2950 states, 2949 states have (on average 1.4991522550016956) internal successors, (4421), 2949 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:46,481 INFO L93 Difference]: Finished difference Result 2952 states and 4422 transitions. [2022-02-20 18:43:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 4422 transitions. [2022-02-20 18:43:46,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:46,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:46,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 2950 states, 2949 states have (on average 1.4991522550016956) internal successors, (4421), 2949 states have internal predecessors, (4421), 0 states have call successors, (0), 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 2952 states. [2022-02-20 18:43:46,497 INFO L87 Difference]: Start difference. First operand has 2950 states, 2949 states have (on average 1.4991522550016956) internal successors, (4421), 2949 states have internal predecessors, (4421), 0 states have call successors, (0), 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 2952 states. [2022-02-20 18:43:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:46,823 INFO L93 Difference]: Finished difference Result 2952 states and 4422 transitions. [2022-02-20 18:43:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 4422 transitions. [2022-02-20 18:43:46,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:46,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:46,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:46,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2949 states have (on average 1.4991522550016956) internal successors, (4421), 2949 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 4421 transitions. [2022-02-20 18:43:47,199 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 4421 transitions. Word has length 43 [2022-02-20 18:43:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:47,199 INFO L470 AbstractCegarLoop]: Abstraction has 2950 states and 4421 transitions. [2022-02-20 18:43:47,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 4421 transitions. [2022-02-20 18:43:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:43:47,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:47,201 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] [2022-02-20 18:43:47,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:43:47,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1723958080, now seen corresponding path program 1 times [2022-02-20 18:43:47,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:47,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331966229] [2022-02-20 18:43:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:47,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {32890#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {32890#true} is VALID [2022-02-20 18:43:47,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {32890#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {32890#true} is VALID [2022-02-20 18:43:47,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {32890#true} assume 0 == ~r1~0; {32890#true} is VALID [2022-02-20 18:43:47,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {32890#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {32890#true} is VALID [2022-02-20 18:43:47,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {32890#true} assume ~id1~0 >= 0; {32890#true} is VALID [2022-02-20 18:43:47,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {32890#true} assume 0 == ~st1~0; {32890#true} is VALID [2022-02-20 18:43:47,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {32890#true} assume ~send1~0 == ~id1~0; {32890#true} is VALID [2022-02-20 18:43:47,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {32890#true} assume 0 == ~mode1~0 % 256; {32890#true} is VALID [2022-02-20 18:43:47,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {32890#true} assume ~id2~0 >= 0; {32890#true} is VALID [2022-02-20 18:43:47,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {32890#true} assume 0 == ~st2~0; {32890#true} is VALID [2022-02-20 18:43:47,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {32890#true} assume ~send2~0 == ~id2~0; {32890#true} is VALID [2022-02-20 18:43:47,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {32890#true} assume 0 == ~mode2~0 % 256; {32890#true} is VALID [2022-02-20 18:43:47,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {32890#true} assume ~id3~0 >= 0; {32890#true} is VALID [2022-02-20 18:43:47,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {32890#true} assume 0 == ~st3~0; {32890#true} is VALID [2022-02-20 18:43:47,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {32890#true} assume ~send3~0 == ~id3~0; {32890#true} is VALID [2022-02-20 18:43:47,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {32890#true} assume 0 == ~mode3~0 % 256; {32890#true} is VALID [2022-02-20 18:43:47,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {32890#true} assume ~id1~0 != ~id2~0; {32890#true} is VALID [2022-02-20 18:43:47,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {32890#true} assume ~id1~0 != ~id3~0; {32890#true} is VALID [2022-02-20 18:43:47,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {32890#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {32892#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:43:47,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {32892#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {32890#true} is VALID [2022-02-20 18:43:47,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {32890#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {32890#true} is VALID [2022-02-20 18:43:47,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {32890#true} assume !!(0 == ~mode1~0 % 256); {32890#true} is VALID [2022-02-20 18:43:47,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {32890#true} assume !!(0 == ~alive1~0 % 256); {32890#true} is VALID [2022-02-20 18:43:47,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {32890#true} assume !(~send1~0 != ~id1~0); {32890#true} is VALID [2022-02-20 18:43:47,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {32890#true} ~mode1~0 := 1; {32890#true} is VALID [2022-02-20 18:43:47,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {32890#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {32890#true} is VALID [2022-02-20 18:43:47,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {32890#true} assume !!(0 == ~mode2~0 % 256); {32890#true} is VALID [2022-02-20 18:43:47,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {32890#true} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {32890#true} is VALID [2022-02-20 18:43:47,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {32890#true} assume ~send2~0 != ~nomsg~0; {32890#true} is VALID [2022-02-20 18:43:47,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {32890#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {32890#true} is VALID [2022-02-20 18:43:47,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {32890#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {32890#true} is VALID [2022-02-20 18:43:47,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {32890#true} ~mode2~0 := 1; {32890#true} is VALID [2022-02-20 18:43:47,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {32890#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {32890#true} is VALID [2022-02-20 18:43:47,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {32890#true} assume !!(0 == ~mode3~0 % 256); {32890#true} is VALID [2022-02-20 18:43:47,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {32890#true} assume !!(0 == ~alive3~0 % 256); {32890#true} is VALID [2022-02-20 18:43:47,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {32890#true} assume !(~send3~0 != ~id3~0); {32890#true} is VALID [2022-02-20 18:43:47,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {32890#true} ~mode3~0 := 1; {32890#true} is VALID [2022-02-20 18:43:47,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {32890#true} ~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; {32890#true} is VALID [2022-02-20 18:43:47,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {32890#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32890#true} is VALID [2022-02-20 18:43:47,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {32890#true} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {32893#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:43:47,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {32893#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {32894#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:43:47,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {32894#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {32891#false} is VALID [2022-02-20 18:43:47,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {32891#false} assume !false; {32891#false} is VALID [2022-02-20 18:43:47,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:43:47,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:47,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331966229] [2022-02-20 18:43:47,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331966229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:47,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:47,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:47,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146431476] [2022-02-20 18:43:47,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:43:47,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:47,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:47,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:47,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:47,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:47,338 INFO L87 Difference]: Start difference. First operand 2950 states and 4421 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:57,035 INFO L93 Difference]: Finished difference Result 6072 states and 9014 transitions. [2022-02-20 18:43:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:43:57,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:43:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2022-02-20 18:43:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2022-02-20 18:43:57,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 218 transitions. [2022-02-20 18:43:57,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:58,534 INFO L225 Difference]: With dead ends: 6072 [2022-02-20 18:43:58,534 INFO L226 Difference]: Without dead ends: 6070 [2022-02-20 18:43:58,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:43:58,536 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 184 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:58,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 571 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6070 states. [2022-02-20 18:44:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6070 to 3142. [2022-02-20 18:44:03,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:03,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6070 states. Second operand has 3142 states, 3141 states have (on average 1.4686405603311048) internal successors, (4613), 3141 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call 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,159 INFO L74 IsIncluded]: Start isIncluded. First operand 6070 states. Second operand has 3142 states, 3141 states have (on average 1.4686405603311048) internal successors, (4613), 3141 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call 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,163 INFO L87 Difference]: Start difference. First operand 6070 states. Second operand has 3142 states, 3141 states have (on average 1.4686405603311048) internal successors, (4613), 3141 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call 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:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:04,053 INFO L93 Difference]: Finished difference Result 6070 states and 8917 transitions. [2022-02-20 18:44:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 8917 transitions. [2022-02-20 18:44:04,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:04,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:04,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 3142 states, 3141 states have (on average 1.4686405603311048) internal successors, (4613), 3141 states have internal predecessors, (4613), 0 states have call successors, (0), 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 6070 states. [2022-02-20 18:44:04,065 INFO L87 Difference]: Start difference. First operand has 3142 states, 3141 states have (on average 1.4686405603311048) internal successors, (4613), 3141 states have internal predecessors, (4613), 0 states have call successors, (0), 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 6070 states. [2022-02-20 18:44:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:05,052 INFO L93 Difference]: Finished difference Result 6070 states and 8917 transitions. [2022-02-20 18:44:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 8917 transitions. [2022-02-20 18:44:05,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:05,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:05,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:05,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 1.4686405603311048) internal successors, (4613), 3141 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call 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,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4613 transitions. [2022-02-20 18:44:05,549 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4613 transitions. Word has length 43 [2022-02-20 18:44:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:05,549 INFO L470 AbstractCegarLoop]: Abstraction has 3142 states and 4613 transitions. [2022-02-20 18:44:05,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4613 transitions. [2022-02-20 18:44:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:44:05,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:05,550 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] [2022-02-20 18:44:05,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:05,550 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1913665939, now seen corresponding path program 1 times [2022-02-20 18:44:05,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:05,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561517681] [2022-02-20 18:44:05,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:05,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {57998#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {57998#true} is VALID [2022-02-20 18:44:05,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {57998#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {57998#true} is VALID [2022-02-20 18:44:05,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {57998#true} assume 0 == ~r1~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {58000#(<= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {58000#(<= ~r1~0 0)} assume ~id1~0 >= 0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {58000#(<= ~r1~0 0)} assume 0 == ~st1~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {58000#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {58000#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {58000#(<= ~r1~0 0)} assume ~id2~0 >= 0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {58000#(<= ~r1~0 0)} assume 0 == ~st2~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {58000#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {58000#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {58000#(<= ~r1~0 0)} assume ~id3~0 >= 0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {58000#(<= ~r1~0 0)} assume 0 == ~st3~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {58000#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {58000#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {58000#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {58000#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {58000#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {58000#(<= ~r1~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; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {58000#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {58000#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {58000#(<= ~r1~0 0)} assume !!(0 == ~alive1~0 % 256); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {58000#(<= ~r1~0 0)} assume !(~send1~0 != ~id1~0); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {58000#(<= ~r1~0 0)} ~mode1~0 := 1; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {58000#(<= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {58000#(<= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {58000#(<= ~r1~0 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {58000#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {58000#(<= ~r1~0 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {58000#(<= ~r1~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); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {58000#(<= ~r1~0 0)} ~mode2~0 := 1; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {58000#(<= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {58000#(<= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {58000#(<= ~r1~0 0)} assume !!(0 == ~alive3~0 % 256); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {58000#(<= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {58000#(<= ~r1~0 0)} ~mode3~0 := 1; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {58000#(<= ~r1~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~0#1; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {58000#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {58000#(<= ~r1~0 0)} is VALID [2022-02-20 18:44:05,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {58000#(<= ~r1~0 0)} assume !(~r1~0 < 3); {57999#false} is VALID [2022-02-20 18:44:05,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {57999#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {57999#false} is VALID [2022-02-20 18:44:05,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {57999#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {57999#false} is VALID [2022-02-20 18:44:05,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {57999#false} assume 0 == main_~assert__arg~0#1 % 256; {57999#false} is VALID [2022-02-20 18:44:05,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {57999#false} assume !false; {57999#false} is VALID [2022-02-20 18:44:05,609 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,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:05,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561517681] [2022-02-20 18:44:05,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561517681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:05,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:05,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:05,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815119563] [2022-02-20 18:44:05,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:05,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:44:05,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:05,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:05,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:05,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:05,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:05,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:05,645 INFO L87 Difference]: Start difference. First operand 3142 states and 4613 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:14,723 INFO L93 Difference]: Finished difference Result 7604 states and 11171 transitions. [2022-02-20 18:44:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:14,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:44:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-02-20 18:44:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-02-20 18:44:14,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 303 transitions. [2022-02-20 18:44:14,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:15,778 INFO L225 Difference]: With dead ends: 7604 [2022-02-20 18:44:15,778 INFO L226 Difference]: Without dead ends: 4482 [2022-02-20 18:44:15,781 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:15,782 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:15,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 236 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2022-02-20 18:44:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4480. [2022-02-20 18:44:22,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:22,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4482 states. Second operand has 4480 states, 4479 states have (on average 1.4594775619557938) internal successors, (6537), 4479 states have internal predecessors, (6537), 0 states have call successors, (0), 0 states have call 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:22,760 INFO L74 IsIncluded]: Start isIncluded. First operand 4482 states. Second operand has 4480 states, 4479 states have (on average 1.4594775619557938) internal successors, (6537), 4479 states have internal predecessors, (6537), 0 states have call successors, (0), 0 states have call 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:22,764 INFO L87 Difference]: Start difference. First operand 4482 states. Second operand has 4480 states, 4479 states have (on average 1.4594775619557938) internal successors, (6537), 4479 states have internal predecessors, (6537), 0 states have call successors, (0), 0 states have call 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:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:23,293 INFO L93 Difference]: Finished difference Result 4482 states and 6538 transitions. [2022-02-20 18:44:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 6538 transitions. [2022-02-20 18:44:23,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:23,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:23,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 4480 states, 4479 states have (on average 1.4594775619557938) internal successors, (6537), 4479 states have internal predecessors, (6537), 0 states have call successors, (0), 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 4482 states. [2022-02-20 18:44:23,304 INFO L87 Difference]: Start difference. First operand has 4480 states, 4479 states have (on average 1.4594775619557938) internal successors, (6537), 4479 states have internal predecessors, (6537), 0 states have call successors, (0), 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 4482 states. [2022-02-20 18:44:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:23,845 INFO L93 Difference]: Finished difference Result 4482 states and 6538 transitions. [2022-02-20 18:44:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 6538 transitions. [2022-02-20 18:44:23,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:23,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:23,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:23,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4480 states, 4479 states have (on average 1.4594775619557938) internal successors, (6537), 4479 states have internal predecessors, (6537), 0 states have call successors, (0), 0 states have call 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:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4480 states to 4480 states and 6537 transitions. [2022-02-20 18:44:24,652 INFO L78 Accepts]: Start accepts. Automaton has 4480 states and 6537 transitions. Word has length 44 [2022-02-20 18:44:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:24,652 INFO L470 AbstractCegarLoop]: Abstraction has 4480 states and 6537 transitions. [2022-02-20 18:44:24,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4480 states and 6537 transitions. [2022-02-20 18:44:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:44:24,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:24,654 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:44:24,654 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1827424966, now seen corresponding path program 1 times [2022-02-20 18:44:24,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:24,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804705959] [2022-02-20 18:44:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:24,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {83949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {83951#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:24,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {83951#(<= (+ ~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {83952#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {83953#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {83953#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {83953#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:44:24,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {83953#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256); {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~alive1~0 % 256); {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(~send1~0 != ~id1~0); {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~mode1~0 := 1; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256); {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:44:24,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {83954#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {83955#(and (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:44:24,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {83955#(and (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {83956#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:44:24,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {83956#(not (= ~nomsg~0 ~p2_new~0))} ~mode2~0 := 1; {83956#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:44:24,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {83956#(not (= ~nomsg~0 ~p2_new~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {83956#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:44:24,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {83956#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256); {83956#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:44:24,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {83956#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~alive3~0 % 256); {83956#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:44:24,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {83956#(not (= ~nomsg~0 ~p2_new~0))} assume !(~send3~0 != ~id3~0); {83956#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:44:24,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {83956#(not (= ~nomsg~0 ~p2_new~0))} ~mode3~0 := 1; {83956#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:44:24,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {83956#(not (= ~nomsg~0 ~p2_new~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~0#1; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~0#1 != ~nomsg~0); {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {83957#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:44:24,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {83957#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {83958#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|))} is VALID [2022-02-20 18:44:24,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {83958#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {83950#false} is VALID [2022-02-20 18:44:24,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {83950#false} ~mode3~0 := 0; {83950#false} is VALID [2022-02-20 18:44:24,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {83950#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {83950#false} is VALID [2022-02-20 18:44:24,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {83950#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {83950#false} is VALID [2022-02-20 18:44:24,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {83950#false} assume !(~r1~0 < 3); {83950#false} is VALID [2022-02-20 18:44:24,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {83950#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {83950#false} is VALID [2022-02-20 18:44:24,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {83950#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {83950#false} is VALID [2022-02-20 18:44:24,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {83950#false} assume 0 == main_~assert__arg~0#1 % 256; {83950#false} is VALID [2022-02-20 18:44:24,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {83950#false} assume !false; {83950#false} is VALID [2022-02-20 18:44:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:24,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:24,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804705959] [2022-02-20 18:44:24,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804705959] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:44:24,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780528106] [2022-02-20 18:44:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:24,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:44:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:24,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:44:24,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:44:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:25,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 18:44:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:25,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:44:25,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {83949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {83949#true} is VALID [2022-02-20 18:44:25,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {83949#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {83949#true} is VALID [2022-02-20 18:44:25,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {83949#true} assume 0 == ~r1~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {83968#(= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {83968#(= ~r1~0 0)} assume ~id1~0 >= 0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {83968#(= ~r1~0 0)} assume 0 == ~st1~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {83968#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {83968#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {83968#(= ~r1~0 0)} assume ~id2~0 >= 0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {83968#(= ~r1~0 0)} assume 0 == ~st2~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {83968#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {83968#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {83968#(= ~r1~0 0)} assume ~id3~0 >= 0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {83968#(= ~r1~0 0)} assume 0 == ~st3~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {83968#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {83968#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {83968#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {83968#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {83968#(= ~r1~0 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {83968#(= ~r1~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; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {83968#(= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {83968#(= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {83968#(= ~r1~0 0)} assume !!(0 == ~alive1~0 % 256); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {83968#(= ~r1~0 0)} assume !(~send1~0 != ~id1~0); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {83968#(= ~r1~0 0)} ~mode1~0 := 1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {83968#(= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {83968#(= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {83968#(= ~r1~0 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {83968#(= ~r1~0 0)} assume ~send2~0 != ~nomsg~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {83968#(= ~r1~0 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {83968#(= ~r1~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); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {83968#(= ~r1~0 0)} ~mode2~0 := 1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {83968#(= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {83968#(= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {83968#(= ~r1~0 0)} assume !!(0 == ~alive3~0 % 256); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {83968#(= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {83968#(= ~r1~0 0)} ~mode3~0 := 1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {83968#(= ~r1~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~0#1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {83968#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {83968#(= ~r1~0 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {84080#(and (= ~r1~0 0) (<= 1 |ULTIMATE.start_main_~check__tmp~0#1|))} is VALID [2022-02-20 18:44:25,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {84080#(and (= ~r1~0 0) (<= 1 |ULTIMATE.start_main_~check__tmp~0#1|))} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {83968#(= ~r1~0 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {83968#(= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {83968#(= ~r1~0 0)} is VALID [2022-02-20 18:44:25,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {83968#(= ~r1~0 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {84093#(= ~r1~0 1)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {84093#(= ~r1~0 1)} ~mode1~0 := 0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {84093#(= ~r1~0 1)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {84093#(= ~r1~0 1)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {84093#(= ~r1~0 1)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {84093#(= ~r1~0 1)} ~mode2~0 := 0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {84093#(= ~r1~0 1)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {84093#(= ~r1~0 1)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {84093#(= ~r1~0 1)} assume !(main_~node3__m3~0#1 != ~nomsg~0); {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {84093#(= ~r1~0 1)} ~mode3~0 := 0; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {84093#(= ~r1~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; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {84093#(= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {84093#(= ~r1~0 1)} is VALID [2022-02-20 18:44:25,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {84093#(= ~r1~0 1)} assume !(~r1~0 < 3); {83950#false} is VALID [2022-02-20 18:44:25,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {83950#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {83950#false} is VALID [2022-02-20 18:44:25,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {83950#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {83950#false} is VALID [2022-02-20 18:44:25,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {83950#false} assume 0 == main_~assert__arg~0#1 % 256; {83950#false} is VALID [2022-02-20 18:44:25,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {83950#false} assume !false; {83950#false} is VALID [2022-02-20 18:44:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:44:25,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:44:26,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {83950#false} assume !false; {83950#false} is VALID [2022-02-20 18:44:26,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {83950#false} assume 0 == main_~assert__arg~0#1 % 256; {83950#false} is VALID [2022-02-20 18:44:26,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {83950#false} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {83950#false} is VALID [2022-02-20 18:44:26,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {83950#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {83950#false} is VALID [2022-02-20 18:44:26,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {84157#(< ~r1~0 3)} assume !(~r1~0 < 3); {83950#false} is VALID [2022-02-20 18:44:26,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {84157#(< ~r1~0 3)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {84157#(< ~r1~0 3)} ~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; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {84157#(< ~r1~0 3)} ~mode3~0 := 0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {84157#(< ~r1~0 3)} assume !(main_~node3__m3~0#1 != ~nomsg~0); {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {84157#(< ~r1~0 3)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {84157#(< ~r1~0 3)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {84157#(< ~r1~0 3)} ~mode2~0 := 0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {84157#(< ~r1~0 3)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {84157#(< ~r1~0 3)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {84157#(< ~r1~0 3)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {84157#(< ~r1~0 3)} ~mode1~0 := 0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {84157#(< ~r1~0 3)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {84157#(< ~r1~0 3)} is VALID [2022-02-20 18:44:26,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~__return_6448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6448~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; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~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; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode3~0 := 1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(~send3~0 != ~id3~0); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~alive3~0 % 256); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode3~0 % 256); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode2~0 := 1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~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); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 != ~nomsg~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode2~0 % 256); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode1~0 := 1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(~send1~0 != ~id1~0); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~alive1~0 % 256); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode1~0 % 256); {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} 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; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6343~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6343~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id3~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id2~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode3~0 % 256; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 == ~id3~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st3~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id3~0 >= 0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode2~0 % 256; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 == ~id2~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st2~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 >= 0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode1~0 % 256; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send1~0 == ~id1~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st1~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 >= 0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {83949#true} assume 0 == ~r1~0; {84197#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:44:26,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {83949#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~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; {83949#true} is VALID [2022-02-20 18:44:26,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {83949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6343~0 := 0;~__return_6448~0 := 0;~__return_6514~0 := 0; {83949#true} is VALID [2022-02-20 18:44:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:44:26,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780528106] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:44:26,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:44:26,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 15 [2022-02-20 18:44:26,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469544761] [2022-02-20 18:44:26,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:44:26,181 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:44:26,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:26,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)