./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.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.4.ufo.BOUNDED-8.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 87c0d05d6e0355591807918f29d7510d5603d16064875313848d28b6b97f865e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:46:52,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:46:52,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:46:52,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:46:52,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:46:52,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:46:52,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:46:52,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:46:52,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:46:52,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:46:52,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:46:52,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:46:52,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:46:52,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:46:52,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:46:52,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:46:52,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:46:52,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:46:52,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:46:52,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:46:52,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:46:52,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:46:52,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:46:52,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:46:52,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:46:52,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:46:52,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:46:52,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:46:52,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:46:52,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:46:52,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:46:52,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:46:52,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:46:52,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:46:52,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:46:52,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:46:52,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:46:52,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:46:52,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:46:52,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:46:52,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:46:52,182 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:46:52,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:46:52,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:46:52,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:46:52,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:46:52,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:46:52,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:46:52,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:46:52,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:46:52,207 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:46:52,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:46:52,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:46:52,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:46:52,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:46:52,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:46:52,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:46:52,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:46:52,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:46:52,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:46:52,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:46:52,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:46:52,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:46:52,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:46:52,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:46:52,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:46:52,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:52,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:46:52,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:46:52,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:46:52,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:46:52,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:46:52,213 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:46:52,213 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:46:52,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:46:52,213 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 -> 87c0d05d6e0355591807918f29d7510d5603d16064875313848d28b6b97f865e [2022-02-20 18:46:52,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:46:52,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:46:52,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:46:52,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:46:52,445 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:46:52,446 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.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:46:52,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac7eb347/14952175e73d47d1b3fe96a666103e61/FLAG5202dd68e [2022-02-20 18:46:52,878 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:46:52,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:46:52,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac7eb347/14952175e73d47d1b3fe96a666103e61/FLAG5202dd68e [2022-02-20 18:46:53,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac7eb347/14952175e73d47d1b3fe96a666103e61 [2022-02-20 18:46:53,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:46:53,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:46:53,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:53,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:46:53,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:46:53,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19bd5e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53, skipping insertion in model container [2022-02-20 18:46:53,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:46:53,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:46:53,543 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.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5337,5350] [2022-02-20 18:46:53,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:53,598 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:46:53,635 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.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5337,5350] [2022-02-20 18:46:53,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:53,684 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:46:53,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53 WrapperNode [2022-02-20 18:46:53,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:53,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:53,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:46:53,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:46:53,694 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:46:53" (1/1) ... [2022-02-20 18:46:53,700 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:46:53" (1/1) ... [2022-02-20 18:46:53,733 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 426 [2022-02-20 18:46:53,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:53,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:46:53,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:46:53,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:46:53,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:46:53,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:46:53,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:46:53,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:46:53,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (1/1) ... [2022-02-20 18:46:53,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:46:53,823 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:46:53,825 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:46:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:46:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:46:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:46:53,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:46:53,951 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:46:53,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:46:54,330 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:46:54,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:46:54,336 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:46:54,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:54 BoogieIcfgContainer [2022-02-20 18:46:54,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:46:54,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:46:54,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:46:54,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:46:54,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:46:53" (1/3) ... [2022-02-20 18:46:54,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15be1087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:54, skipping insertion in model container [2022-02-20 18:46:54,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:53" (2/3) ... [2022-02-20 18:46:54,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15be1087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:54, skipping insertion in model container [2022-02-20 18:46:54,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:54" (3/3) ... [2022-02-20 18:46:54,343 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:46:54,346 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:46:54,347 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:46:54,379 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:46:54,383 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:46:54,384 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:46:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:46:54,410 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:54,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:54,411 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1289871298, now seen corresponding path program 1 times [2022-02-20 18:46:54,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:54,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708305966] [2022-02-20 18:46:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:54,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#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(63, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19424~0 := 0;~__return_19510~0 := 0; {113#true} is VALID [2022-02-20 18:46:54,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {113#true} is VALID [2022-02-20 18:46:54,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} assume 0 == ~r1~0; {113#true} is VALID [2022-02-20 18:46:54,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {113#true} is VALID [2022-02-20 18:46:54,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {113#true} assume ~id1~0 >= 0; {113#true} is VALID [2022-02-20 18:46:54,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#true} assume 0 == ~st1~0; {113#true} is VALID [2022-02-20 18:46:54,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {113#true} assume ~send1~0 == ~id1~0; {113#true} is VALID [2022-02-20 18:46:54,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {113#true} assume 0 == ~mode1~0 % 256; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {115#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {115#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:54,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {115#(= (+ (* (- 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:46:54,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {114#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:46:54,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {114#false} ~mode1~0 := 0; {114#false} is VALID [2022-02-20 18:46:54,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {114#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:46:54,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {114#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:46:54,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {114#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:46:54,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {114#false} ~mode2~0 := 0; {114#false} is VALID [2022-02-20 18:46:54,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {114#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:46:54,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {114#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:46:54,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {114#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:46:54,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {114#false} ~mode3~0 := 0; {114#false} is VALID [2022-02-20 18:46:54,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {114#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:46:54,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {114#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:46:54,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {114#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:46:54,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {114#false} ~mode4~0 := 0; {114#false} is VALID [2022-02-20 18:46:54,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {114#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {114#false} is VALID [2022-02-20 18:46:54,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {114#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {114#false} is VALID [2022-02-20 18:46:54,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {114#false} ~__return_19424~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19424~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; {114#false} is VALID [2022-02-20 18:46:54,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {114#false} assume 0 == main_~assert__arg~0#1 % 256; {114#false} is VALID [2022-02-20 18:46:54,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {114#false} assume !false; {114#false} is VALID [2022-02-20 18:46:54,681 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:46:54,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:54,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708305966] [2022-02-20 18:46:54,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708305966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:54,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:54,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:54,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300527430] [2022-02-20 18:46:54,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:46:54,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:54,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:54,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:54,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:54,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:54,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:54,765 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 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 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:55,085 INFO L93 Difference]: Finished difference Result 260 states and 419 transitions. [2022-02-20 18:46:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:46:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2022-02-20 18:46:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2022-02-20 18:46:55,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 419 transitions. [2022-02-20 18:46:55,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:55,398 INFO L225 Difference]: With dead ends: 260 [2022-02-20 18:46:55,399 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 18:46:55,401 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:46:55,403 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 137 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 401 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:46:55,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 401 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 18:46:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-02-20 18:46:55,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:55,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 169 states, 168 states have (on average 1.505952380952381) internal successors, (253), 168 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,433 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 169 states, 168 states have (on average 1.505952380952381) internal successors, (253), 168 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,434 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 169 states, 168 states have (on average 1.505952380952381) internal successors, (253), 168 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:55,444 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2022-02-20 18:46:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2022-02-20 18:46:55,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:55,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:55,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 168 states have (on average 1.505952380952381) internal successors, (253), 168 states have internal predecessors, (253), 0 states have call successors, (0), 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 171 states. [2022-02-20 18:46:55,446 INFO L87 Difference]: Start difference. First operand has 169 states, 168 states have (on average 1.505952380952381) internal successors, (253), 168 states have internal predecessors, (253), 0 states have call successors, (0), 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 171 states. [2022-02-20 18:46:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:55,451 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2022-02-20 18:46:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2022-02-20 18:46:55,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:55,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:55,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:55,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.505952380952381) internal successors, (253), 168 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2022-02-20 18:46:55,458 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 48 [2022-02-20 18:46:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:55,458 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2022-02-20 18:46:55,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2022-02-20 18:46:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:46:55,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:55,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:55,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:46:55,460 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1971653998, now seen corresponding path program 1 times [2022-02-20 18:46:55,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:55,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076015497] [2022-02-20 18:46:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:55,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {1030#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(63, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19424~0 := 0;~__return_19510~0 := 0; {1030#true} is VALID [2022-02-20 18:46:55,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {1030#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {1030#true} is VALID [2022-02-20 18:46:55,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {1030#true} assume 0 == ~r1~0; {1030#true} is VALID [2022-02-20 18:46:55,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {1030#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1030#true} is VALID [2022-02-20 18:46:55,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {1030#true} assume ~id1~0 >= 0; {1030#true} is VALID [2022-02-20 18:46:55,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1030#true} assume 0 == ~st1~0; {1030#true} is VALID [2022-02-20 18:46:55,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#true} assume ~send1~0 == ~id1~0; {1030#true} is VALID [2022-02-20 18:46:55,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#true} assume 0 == ~mode1~0 % 256; {1030#true} is VALID [2022-02-20 18:46:55,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {1030#true} assume ~id2~0 >= 0; {1030#true} is VALID [2022-02-20 18:46:55,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {1030#true} assume 0 == ~st2~0; {1030#true} is VALID [2022-02-20 18:46:55,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {1030#true} assume ~send2~0 == ~id2~0; {1030#true} is VALID [2022-02-20 18:46:55,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {1030#true} assume 0 == ~mode2~0 % 256; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {1032#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1032#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:55,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {1032#(= (+ (* (- 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; {1031#false} is VALID [2022-02-20 18:46:55,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {1031#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {1031#false} is VALID [2022-02-20 18:46:55,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {1031#false} ~mode2~0 := 0; {1031#false} is VALID [2022-02-20 18:46:55,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {1031#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1031#false} is VALID [2022-02-20 18:46:55,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {1031#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1031#false} is VALID [2022-02-20 18:46:55,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {1031#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1031#false} is VALID [2022-02-20 18:46:55,542 INFO L290 TraceCheckUtils]: 39: Hoare triple {1031#false} ~mode3~0 := 0; {1031#false} is VALID [2022-02-20 18:46:55,542 INFO L290 TraceCheckUtils]: 40: Hoare triple {1031#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1031#false} is VALID [2022-02-20 18:46:55,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {1031#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1031#false} is VALID [2022-02-20 18:46:55,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {1031#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1031#false} is VALID [2022-02-20 18:46:55,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {1031#false} ~mode4~0 := 0; {1031#false} is VALID [2022-02-20 18:46:55,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {1031#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1031#false} is VALID [2022-02-20 18:46:55,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {1031#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {1031#false} is VALID [2022-02-20 18:46:55,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {1031#false} ~__return_19424~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19424~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; {1031#false} is VALID [2022-02-20 18:46:55,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {1031#false} assume 0 == main_~assert__arg~0#1 % 256; {1031#false} is VALID [2022-02-20 18:46:55,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2022-02-20 18:46:55,544 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:46:55,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:55,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076015497] [2022-02-20 18:46:55,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076015497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:55,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:55,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:55,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544612333] [2022-02-20 18:46:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:46:55,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:55,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:55,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:55,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:55,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:55,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:55,578 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:55,778 INFO L93 Difference]: Finished difference Result 421 states and 653 transitions. [2022-02-20 18:46:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:55,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:46:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-02-20 18:46:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-02-20 18:46:55,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 382 transitions. [2022-02-20 18:46:56,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:56,037 INFO L225 Difference]: With dead ends: 421 [2022-02-20 18:46:56,037 INFO L226 Difference]: Without dead ends: 279 [2022-02-20 18:46:56,038 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:46:56,039 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 110 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 348 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:46:56,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-20 18:46:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2022-02-20 18:46:56,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:56,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.536231884057971) internal successors, (424), 276 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,055 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.536231884057971) internal successors, (424), 276 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,055 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.536231884057971) internal successors, (424), 276 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,062 INFO L93 Difference]: Finished difference Result 279 states and 425 transitions. [2022-02-20 18:46:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 425 transitions. [2022-02-20 18:46:56,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:56,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:56,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 276 states have (on average 1.536231884057971) internal successors, (424), 276 states have internal predecessors, (424), 0 states have call successors, (0), 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 279 states. [2022-02-20 18:46:56,065 INFO L87 Difference]: Start difference. First operand has 277 states, 276 states have (on average 1.536231884057971) internal successors, (424), 276 states have internal predecessors, (424), 0 states have call successors, (0), 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 279 states. [2022-02-20 18:46:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,072 INFO L93 Difference]: Finished difference Result 279 states and 425 transitions. [2022-02-20 18:46:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 425 transitions. [2022-02-20 18:46:56,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:56,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:56,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:56,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.536231884057971) internal successors, (424), 276 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 424 transitions. [2022-02-20 18:46:56,081 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 424 transitions. Word has length 49 [2022-02-20 18:46:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:56,081 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 424 transitions. [2022-02-20 18:46:56,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 424 transitions. [2022-02-20 18:46:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:46:56,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:56,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:56,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:46:56,082 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 663495285, now seen corresponding path program 1 times [2022-02-20 18:46:56,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:56,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470150808] [2022-02-20 18:46:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:56,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {2537#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(63, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19424~0 := 0;~__return_19510~0 := 0; {2537#true} is VALID [2022-02-20 18:46:56,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {2537#true} is VALID [2022-02-20 18:46:56,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume 0 == ~r1~0; {2537#true} is VALID [2022-02-20 18:46:56,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {2537#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2537#true} is VALID [2022-02-20 18:46:56,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {2537#true} assume ~id1~0 >= 0; {2537#true} is VALID [2022-02-20 18:46:56,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} assume 0 == ~st1~0; {2537#true} is VALID [2022-02-20 18:46:56,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {2537#true} assume ~send1~0 == ~id1~0; {2537#true} is VALID [2022-02-20 18:46:56,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {2537#true} assume 0 == ~mode1~0 % 256; {2537#true} is VALID [2022-02-20 18:46:56,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {2537#true} assume ~id2~0 >= 0; {2537#true} is VALID [2022-02-20 18:46:56,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {2537#true} assume 0 == ~st2~0; {2537#true} is VALID [2022-02-20 18:46:56,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {2537#true} assume ~send2~0 == ~id2~0; {2537#true} is VALID [2022-02-20 18:46:56,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {2537#true} assume 0 == ~mode2~0 % 256; {2537#true} is VALID [2022-02-20 18:46:56,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {2537#true} assume ~id3~0 >= 0; {2537#true} is VALID [2022-02-20 18:46:56,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {2537#true} assume 0 == ~st3~0; {2537#true} is VALID [2022-02-20 18:46:56,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#true} assume ~send3~0 == ~id3~0; {2537#true} is VALID [2022-02-20 18:46:56,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {2537#true} assume 0 == ~mode3~0 % 256; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {2539#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2539#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:56,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {2539#(= (+ (* (- 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; {2538#false} is VALID [2022-02-20 18:46:56,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {2538#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {2538#false} is VALID [2022-02-20 18:46:56,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#false} ~mode3~0 := 0; {2538#false} is VALID [2022-02-20 18:46:56,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2538#false} is VALID [2022-02-20 18:46:56,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2538#false} is VALID [2022-02-20 18:46:56,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {2538#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2538#false} is VALID [2022-02-20 18:46:56,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {2538#false} ~mode4~0 := 0; {2538#false} is VALID [2022-02-20 18:46:56,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {2538#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2538#false} is VALID [2022-02-20 18:46:56,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {2538#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {2538#false} is VALID [2022-02-20 18:46:56,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {2538#false} ~__return_19424~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19424~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; {2538#false} is VALID [2022-02-20 18:46:56,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {2538#false} assume 0 == main_~assert__arg~0#1 % 256; {2538#false} is VALID [2022-02-20 18:46:56,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-02-20 18:46:56,159 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:46:56,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:56,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470150808] [2022-02-20 18:46:56,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470150808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:56,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:56,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:56,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280749205] [2022-02-20 18:46:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:56,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:46:56,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:56,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:56,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:56,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:56,187 INFO L87 Difference]: Start difference. First operand 277 states and 424 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,403 INFO L93 Difference]: Finished difference Result 713 states and 1114 transitions. [2022-02-20 18:46:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:46:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-02-20 18:46:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-02-20 18:46:56,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 382 transitions. [2022-02-20 18:46:56,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:56,662 INFO L225 Difference]: With dead ends: 713 [2022-02-20 18:46:56,662 INFO L226 Difference]: Without dead ends: 463 [2022-02-20 18:46:56,664 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:46:56,665 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 105 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 333 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:46:56,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 333 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-02-20 18:46:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2022-02-20 18:46:56,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:56,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 463 states. Second operand has 461 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 460 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,693 INFO L74 IsIncluded]: Start isIncluded. First operand 463 states. Second operand has 461 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 460 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,693 INFO L87 Difference]: Start difference. First operand 463 states. Second operand has 461 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 460 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,705 INFO L93 Difference]: Finished difference Result 463 states and 713 transitions. [2022-02-20 18:46:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 713 transitions. [2022-02-20 18:46:56,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:56,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:56,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 461 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 460 states have internal predecessors, (712), 0 states have call successors, (0), 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 463 states. [2022-02-20 18:46:56,708 INFO L87 Difference]: Start difference. First operand has 461 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 460 states have internal predecessors, (712), 0 states have call successors, (0), 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 463 states. [2022-02-20 18:46:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,720 INFO L93 Difference]: Finished difference Result 463 states and 713 transitions. [2022-02-20 18:46:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 713 transitions. [2022-02-20 18:46:56,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:56,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:56,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:56,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5478260869565217) internal successors, (712), 460 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 712 transitions. [2022-02-20 18:46:56,734 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 712 transitions. Word has length 50 [2022-02-20 18:46:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:56,735 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 712 transitions. [2022-02-20 18:46:56,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 712 transitions. [2022-02-20 18:46:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:46:56,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:56,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:56,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:46:56,736 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1706895887, now seen corresponding path program 1 times [2022-02-20 18:46:56,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:56,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620704111] [2022-02-20 18:46:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:56,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {5074#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(63, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19424~0 := 0;~__return_19510~0 := 0; {5074#true} is VALID [2022-02-20 18:46:56,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {5074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {5074#true} is VALID [2022-02-20 18:46:56,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {5074#true} assume 0 == ~r1~0; {5074#true} is VALID [2022-02-20 18:46:56,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {5074#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {5074#true} is VALID [2022-02-20 18:46:56,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {5074#true} assume ~id1~0 >= 0; {5074#true} is VALID [2022-02-20 18:46:56,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {5074#true} assume 0 == ~st1~0; {5074#true} is VALID [2022-02-20 18:46:56,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {5074#true} assume ~send1~0 == ~id1~0; {5074#true} is VALID [2022-02-20 18:46:56,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {5074#true} assume 0 == ~mode1~0 % 256; {5074#true} is VALID [2022-02-20 18:46:56,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {5074#true} assume ~id2~0 >= 0; {5074#true} is VALID [2022-02-20 18:46:56,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#true} assume 0 == ~st2~0; {5074#true} is VALID [2022-02-20 18:46:56,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#true} assume ~send2~0 == ~id2~0; {5074#true} is VALID [2022-02-20 18:46:56,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {5074#true} assume 0 == ~mode2~0 % 256; {5074#true} is VALID [2022-02-20 18:46:56,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {5074#true} assume ~id3~0 >= 0; {5074#true} is VALID [2022-02-20 18:46:56,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {5074#true} assume 0 == ~st3~0; {5074#true} is VALID [2022-02-20 18:46:56,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {5074#true} assume ~send3~0 == ~id3~0; {5074#true} is VALID [2022-02-20 18:46:56,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {5074#true} assume 0 == ~mode3~0 % 256; {5074#true} is VALID [2022-02-20 18:46:56,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {5074#true} assume ~id4~0 >= 0; {5074#true} is VALID [2022-02-20 18:46:56,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {5074#true} assume 0 == ~st4~0; {5074#true} is VALID [2022-02-20 18:46:56,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {5074#true} assume ~send4~0 == ~id4~0; {5074#true} is VALID [2022-02-20 18:46:56,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {5074#true} assume 0 == ~mode4~0 % 256; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive1~0 % 256); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive2~0 % 256); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive3~0 % 256); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:56,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {5076#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5075#false} is VALID [2022-02-20 18:46:56,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {5075#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {5075#false} is VALID [2022-02-20 18:46:56,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {5075#false} ~mode4~0 := 0; {5075#false} is VALID [2022-02-20 18:46:56,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {5075#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5075#false} is VALID [2022-02-20 18:46:56,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {5075#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {5075#false} is VALID [2022-02-20 18:46:56,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {5075#false} ~__return_19424~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19424~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; {5075#false} is VALID [2022-02-20 18:46:56,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {5075#false} assume 0 == main_~assert__arg~0#1 % 256; {5075#false} is VALID [2022-02-20 18:46:56,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {5075#false} assume !false; {5075#false} is VALID [2022-02-20 18:46:56,803 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:46:56,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:56,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620704111] [2022-02-20 18:46:56,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620704111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:56,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:56,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:56,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263217257] [2022-02-20 18:46:56,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:56,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:46:56,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:56,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:56,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:56,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:56,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:56,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:56,837 INFO L87 Difference]: Start difference. First operand 461 states and 712 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:57,090 INFO L93 Difference]: Finished difference Result 1201 states and 1874 transitions. [2022-02-20 18:46:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:57,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:46:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-02-20 18:46:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-02-20 18:46:57,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 382 transitions. [2022-02-20 18:46:57,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:57,368 INFO L225 Difference]: With dead ends: 1201 [2022-02-20 18:46:57,368 INFO L226 Difference]: Without dead ends: 767 [2022-02-20 18:46:57,368 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:46:57,369 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 100 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 318 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:46:57,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 318 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-02-20 18:46:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2022-02-20 18:46:57,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:57,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 767 states. Second operand has 765 states, 764 states have (on average 1.544502617801047) internal successors, (1180), 764 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,402 INFO L74 IsIncluded]: Start isIncluded. First operand 767 states. Second operand has 765 states, 764 states have (on average 1.544502617801047) internal successors, (1180), 764 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,404 INFO L87 Difference]: Start difference. First operand 767 states. Second operand has 765 states, 764 states have (on average 1.544502617801047) internal successors, (1180), 764 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:57,424 INFO L93 Difference]: Finished difference Result 767 states and 1181 transitions. [2022-02-20 18:46:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1181 transitions. [2022-02-20 18:46:57,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:57,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:57,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 765 states, 764 states have (on average 1.544502617801047) internal successors, (1180), 764 states have internal predecessors, (1180), 0 states have call successors, (0), 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 767 states. [2022-02-20 18:46:57,427 INFO L87 Difference]: Start difference. First operand has 765 states, 764 states have (on average 1.544502617801047) internal successors, (1180), 764 states have internal predecessors, (1180), 0 states have call successors, (0), 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 767 states. [2022-02-20 18:46:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:57,446 INFO L93 Difference]: Finished difference Result 767 states and 1181 transitions. [2022-02-20 18:46:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1181 transitions. [2022-02-20 18:46:57,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:57,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:57,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:57,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.544502617801047) internal successors, (1180), 764 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1180 transitions. [2022-02-20 18:46:57,475 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1180 transitions. Word has length 51 [2022-02-20 18:46:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:57,475 INFO L470 AbstractCegarLoop]: Abstraction has 765 states and 1180 transitions. [2022-02-20 18:46:57,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1180 transitions. [2022-02-20 18:46:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:46:57,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:57,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:46:57,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:46:57,476 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1133800764, now seen corresponding path program 1 times [2022-02-20 18:46:57,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:57,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517606625] [2022-02-20 18:46:57,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:57,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:57,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {9323#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(63, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19424~0 := 0;~__return_19510~0 := 0; {9323#true} is VALID [2022-02-20 18:46:57,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {9323#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {9323#true} is VALID [2022-02-20 18:46:57,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {9323#true} assume 0 == ~r1~0; {9323#true} is VALID [2022-02-20 18:46:57,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {9323#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {9323#true} is VALID [2022-02-20 18:46:57,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {9323#true} assume ~id1~0 >= 0; {9323#true} is VALID [2022-02-20 18:46:57,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {9323#true} assume 0 == ~st1~0; {9325#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:57,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {9325#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {9325#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:57,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {9325#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {9325#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:57,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {9325#(<= ~st1~0 0)} assume ~id2~0 >= 0; {9325#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:57,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {9325#(<= ~st1~0 0)} assume 0 == ~st2~0; {9326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {9326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {9326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {9326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {9326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {9326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {9326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {9326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {9327#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {9328#(<= (+ ~st4~0 ~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:57,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {9328#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {9324#false} is VALID [2022-02-20 18:46:57,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {9324#false} ~__return_19424~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19424~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; {9324#false} is VALID [2022-02-20 18:46:57,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {9324#false} assume 0 == main_~assert__arg~0#1 % 256; {9324#false} is VALID [2022-02-20 18:46:57,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {9324#false} assume !false; {9324#false} is VALID [2022-02-20 18:46:57,606 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:46:57,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:57,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517606625] [2022-02-20 18:46:57,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517606625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:57,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:57,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:46:57,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112055469] [2022-02-20 18:46:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:46:57,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:57,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:57,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:57,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:46:57,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:46:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:57,650 INFO L87 Difference]: Start difference. First operand 765 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:00,824 INFO L93 Difference]: Finished difference Result 4455 states and 6945 transitions. [2022-02-20 18:47:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:00,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:47:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2022-02-20 18:47:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2022-02-20 18:47:00,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 789 transitions. [2022-02-20 18:47:01,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 789 edges. 789 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:01,981 INFO L225 Difference]: With dead ends: 4455 [2022-02-20 18:47:01,982 INFO L226 Difference]: Without dead ends: 3717 [2022-02-20 18:47:01,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:47:01,984 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 904 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:01,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [904 Valid, 1080 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2022-02-20 18:47:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 1501. [2022-02-20 18:47:02,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:02,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3717 states. Second operand has 1501 states, 1500 states have (on average 1.5333333333333334) internal successors, (2300), 1500 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:02,940 INFO L74 IsIncluded]: Start isIncluded. First operand 3717 states. Second operand has 1501 states, 1500 states have (on average 1.5333333333333334) internal successors, (2300), 1500 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:02,942 INFO L87 Difference]: Start difference. First operand 3717 states. Second operand has 1501 states, 1500 states have (on average 1.5333333333333334) internal successors, (2300), 1500 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:03,373 INFO L93 Difference]: Finished difference Result 3717 states and 5760 transitions. [2022-02-20 18:47:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5760 transitions. [2022-02-20 18:47:03,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:03,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:03,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 1501 states, 1500 states have (on average 1.5333333333333334) internal successors, (2300), 1500 states have internal predecessors, (2300), 0 states have call successors, (0), 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 3717 states. [2022-02-20 18:47:03,385 INFO L87 Difference]: Start difference. First operand has 1501 states, 1500 states have (on average 1.5333333333333334) internal successors, (2300), 1500 states have internal predecessors, (2300), 0 states have call successors, (0), 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 3717 states. [2022-02-20 18:47:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:03,826 INFO L93 Difference]: Finished difference Result 3717 states and 5760 transitions. [2022-02-20 18:47:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5760 transitions. [2022-02-20 18:47:03,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:03,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:03,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:03,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1500 states have (on average 1.5333333333333334) internal successors, (2300), 1500 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2300 transitions. [2022-02-20 18:47:03,943 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2300 transitions. Word has length 52 [2022-02-20 18:47:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:03,944 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2300 transitions. [2022-02-20 18:47:03,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2300 transitions. [2022-02-20 18:47:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:47:03,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:03,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:03,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:47:03,946 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:03,946 INFO L85 PathProgramCache]: Analyzing trace with hash 768629036, now seen corresponding path program 1 times [2022-02-20 18:47:03,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:03,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499037237] [2022-02-20 18:47:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:04,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {25032#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(63, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19424~0 := 0;~__return_19510~0 := 0; {25032#true} is VALID [2022-02-20 18:47:04,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {25032#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {25032#true} is VALID [2022-02-20 18:47:04,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {25032#true} assume 0 == ~r1~0; {25032#true} is VALID [2022-02-20 18:47:04,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {25032#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:04,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {25034#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:04,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:04,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:04,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:04,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:04,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {25035#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:04,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:04,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:04,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:04,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:04,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {25036#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:04,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:04,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1; {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:04,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:04,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~mode4~0 % 256); {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:47:04,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {25037#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~alive4~0 % 256); {25033#false} is VALID [2022-02-20 18:47:04,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {25033#false} assume !(~send4~0 != ~id4~0); {25033#false} is VALID [2022-02-20 18:47:04,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {25033#false} ~mode4~0 := 1; {25033#false} is VALID [2022-02-20 18:47:04,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {25033#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {25033#false} is VALID [2022-02-20 18:47:04,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {25033#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {25033#false} is VALID [2022-02-20 18:47:04,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {25033#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {25033#false} is VALID [2022-02-20 18:47:04,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {25033#false} ~__return_19424~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19424~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; {25033#false} is VALID [2022-02-20 18:47:04,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {25033#false} assume 0 == main_~assert__arg~0#1 % 256; {25033#false} is VALID [2022-02-20 18:47:04,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {25033#false} assume !false; {25033#false} is VALID [2022-02-20 18:47:04,123 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:47:04,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:04,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499037237] [2022-02-20 18:47:04,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499037237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:04,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:04,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:47:04,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934697582] [2022-02-20 18:47:04,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:47:04,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:04,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:04,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:04,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:47:04,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:04,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:47:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:04,165 INFO L87 Difference]: Start difference. First operand 1501 states and 2300 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:11,487 INFO L93 Difference]: Finished difference Result 6501 states and 9920 transitions. [2022-02-20 18:47:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:47:11,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:47:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-02-20 18:47:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-02-20 18:47:11,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 570 transitions. [2022-02-20 18:47:11,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:13,048 INFO L225 Difference]: With dead ends: 6501 [2022-02-20 18:47:13,049 INFO L226 Difference]: Without dead ends: 5027 [2022-02-20 18:47:13,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:47:13,051 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 547 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:13,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 668 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2022-02-20 18:47:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 5021. [2022-02-20 18:47:17,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:17,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5027 states. Second operand has 5021 states, 5020 states have (on average 1.5163346613545816) internal successors, (7612), 5020 states have internal predecessors, (7612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:17,348 INFO L74 IsIncluded]: Start isIncluded. First operand 5027 states. Second operand has 5021 states, 5020 states have (on average 1.5163346613545816) internal successors, (7612), 5020 states have internal predecessors, (7612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:17,354 INFO L87 Difference]: Start difference. First operand 5027 states. Second operand has 5021 states, 5020 states have (on average 1.5163346613545816) internal successors, (7612), 5020 states have internal predecessors, (7612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:18,074 INFO L93 Difference]: Finished difference Result 5027 states and 7615 transitions. [2022-02-20 18:47:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 7615 transitions. [2022-02-20 18:47:18,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:18,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:18,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 5021 states, 5020 states have (on average 1.5163346613545816) internal successors, (7612), 5020 states have internal predecessors, (7612), 0 states have call successors, (0), 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 5027 states. [2022-02-20 18:47:18,089 INFO L87 Difference]: Start difference. First operand has 5021 states, 5020 states have (on average 1.5163346613545816) internal successors, (7612), 5020 states have internal predecessors, (7612), 0 states have call successors, (0), 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 5027 states. [2022-02-20 18:47:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:18,844 INFO L93 Difference]: Finished difference Result 5027 states and 7615 transitions. [2022-02-20 18:47:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 7615 transitions. [2022-02-20 18:47:18,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:18,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:18,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:18,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5021 states, 5020 states have (on average 1.5163346613545816) internal successors, (7612), 5020 states have internal predecessors, (7612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 7612 transitions. [2022-02-20 18:47:19,943 INFO L78 Accepts]: Start accepts. Automaton has 5021 states and 7612 transitions. Word has length 53 [2022-02-20 18:47:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:19,944 INFO L470 AbstractCegarLoop]: Abstraction has 5021 states and 7612 transitions. [2022-02-20 18:47:19,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5021 states and 7612 transitions. [2022-02-20 18:47:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:47:19,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:19,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:19,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:47:19,945 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1792030237, now seen corresponding path program 1 times [2022-02-20 18:47:19,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:19,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211303134] [2022-02-20 18:47:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:20,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {51160#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(63, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_19289~0 := 0;~__return_19424~0 := 0;~__return_19510~0 := 0; {51162#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:20,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {51162#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~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;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {51162#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:20,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {51162#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {51162#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:20,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {51162#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {51162#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:20,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {51162#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {51163#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:47:20,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {51163#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {51163#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:47:20,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {51163#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_19289~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_19289~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {51164#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:20,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {51164#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {51161#false} is VALID [2022-02-20 18:47:20,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {51161#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {51161#false} is VALID [2022-02-20 18:47:20,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {51161#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {51161#false} is VALID [2022-02-20 18:47:20,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {51161#false} ~mode1~0 := 1; {51161#false} is VALID [2022-02-20 18:47:20,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {51161#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {51161#false} is VALID [2022-02-20 18:47:20,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {51161#false} assume !!(0 == ~mode2~0 % 256); {51161#false} is VALID [2022-02-20 18:47:20,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {51161#false} assume !!(0 == ~alive2~0 % 256); {51161#false} is VALID [2022-02-20 18:47:20,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {51161#false} assume !(~send2~0 != ~id2~0); {51161#false} is VALID [2022-02-20 18:47:20,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {51161#false} ~mode2~0 := 1; {51161#false} is VALID [2022-02-20 18:47:20,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {51161#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {51161#false} is VALID [2022-02-20 18:47:20,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {51161#false} assume !!(0 == ~mode3~0 % 256); {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {51161#false} assume !!(0 == ~alive3~0 % 256); {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {51161#false} assume !(~send3~0 != ~id3~0); {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {51161#false} ~mode3~0 := 1; {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {51161#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {51161#false} assume !!(0 == ~mode4~0 % 256); {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {51161#false} assume !!(0 == ~alive4~0 % 256); {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {51161#false} assume !(~send4~0 != ~id4~0); {51161#false} is VALID [2022-02-20 18:47:20,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {51161#false} ~mode4~0 := 1; {51161#false} is VALID [2022-02-20 18:47:20,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {51161#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {51161#false} is VALID [2022-02-20 18:47:20,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {51161#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {51161#false} is VALID [2022-02-20 18:47:20,022 INFO L290 TraceCheckUtils]: 51: Hoare triple {51161#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {51161#false} is VALID [2022-02-20 18:47:20,022 INFO L290 TraceCheckUtils]: 52: Hoare triple {51161#false} ~__return_19424~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_19424~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; {51161#false} is VALID [2022-02-20 18:47:20,022 INFO L290 TraceCheckUtils]: 53: Hoare triple {51161#false} assume 0 == main_~assert__arg~0#1 % 256; {51161#false} is VALID [2022-02-20 18:47:20,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {51161#false} assume !false; {51161#false} is VALID [2022-02-20 18:47:20,022 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:47:20,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:20,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211303134] [2022-02-20 18:47:20,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211303134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:20,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:20,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:47:20,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337660462] [2022-02-20 18:47:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:20,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:47:20,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:20,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:20,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:20,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:20,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:20,052 INFO L87 Difference]: Start difference. First operand 5021 states and 7612 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:41,114 INFO L93 Difference]: Finished difference Result 13905 states and 21118 transitions. [2022-02-20 18:47:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:47:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:47:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:47:41,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 408 transitions. [2022-02-20 18:47:41,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:45,193 INFO L225 Difference]: With dead ends: 13905 [2022-02-20 18:47:45,193 INFO L226 Difference]: Without dead ends: 8911 [2022-02-20 18:47:45,228 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:47:45,231 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 666 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:45,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [666 Valid, 171 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8911 states. [2022-02-20 18:47:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8911 to 8909. [2022-02-20 18:47:58,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:58,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8911 states. Second operand has 8909 states, 8908 states have (on average 1.5065110013471037) internal successors, (13420), 8908 states have internal predecessors, (13420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:58,981 INFO L74 IsIncluded]: Start isIncluded. First operand 8911 states. Second operand has 8909 states, 8908 states have (on average 1.5065110013471037) internal successors, (13420), 8908 states have internal predecessors, (13420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:58,988 INFO L87 Difference]: Start difference. First operand 8911 states. Second operand has 8909 states, 8908 states have (on average 1.5065110013471037) internal successors, (13420), 8908 states have internal predecessors, (13420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:01,448 INFO L93 Difference]: Finished difference Result 8911 states and 13421 transitions. [2022-02-20 18:48:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8911 states and 13421 transitions. [2022-02-20 18:48:01,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:01,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:01,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 8909 states, 8908 states have (on average 1.5065110013471037) internal successors, (13420), 8908 states have internal predecessors, (13420), 0 states have call successors, (0), 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 8911 states. [2022-02-20 18:48:01,474 INFO L87 Difference]: Start difference. First operand has 8909 states, 8908 states have (on average 1.5065110013471037) internal successors, (13420), 8908 states have internal predecessors, (13420), 0 states have call successors, (0), 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 8911 states. [2022-02-20 18:48:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:03,971 INFO L93 Difference]: Finished difference Result 8911 states and 13421 transitions. [2022-02-20 18:48:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8911 states and 13421 transitions. [2022-02-20 18:48:03,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:03,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:03,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:03,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8909 states, 8908 states have (on average 1.5065110013471037) internal successors, (13420), 8908 states have internal predecessors, (13420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)