./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd47f3526eef69b5bf2f51fee8d66c64e4c81e1dda46c7d333fbe79bb4350dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:47:35,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:47:35,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:47:35,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:47:35,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:47:35,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:47:35,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:47:35,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:47:35,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:47:35,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:47:35,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:47:35,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:47:35,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:47:35,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:47:35,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:47:35,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:47:35,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:47:35,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:47:35,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:47:35,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:47:35,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:47:35,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:47:35,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:47:36,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:47:36,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:47:36,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:47:36,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:47:36,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:47:36,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:47:36,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:47:36,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:47:36,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:47:36,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:47:36,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:47:36,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:47:36,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:47:36,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:47:36,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:47:36,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:47:36,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:47:36,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:47:36,018 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:47:36,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:47:36,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:47:36,051 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:47:36,051 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:47:36,052 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:47:36,052 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:47:36,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:47:36,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:47:36,053 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:47:36,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:47:36,054 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:47:36,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:47:36,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:47:36,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:47:36,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:47:36,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:47:36,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:47:36,055 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:47:36,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:47:36,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:47:36,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:47:36,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:47:36,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:47:36,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:47:36,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:47:36,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:47:36,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:47:36,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:47:36,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:47:36,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:47:36,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:47:36,058 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:47:36,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:47:36,058 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 -> ccd47f3526eef69b5bf2f51fee8d66c64e4c81e1dda46c7d333fbe79bb4350dd [2022-02-20 18:47:36,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:47:36,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:47:36,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:47:36,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:47:36,335 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:47:36,336 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:47:36,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17b18ff1/1a751326bd004fa9981c0f21acf7e7ce/FLAG7e5808b09 [2022-02-20 18:47:36,798 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:47:36,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:47:36,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17b18ff1/1a751326bd004fa9981c0f21acf7e7ce/FLAG7e5808b09 [2022-02-20 18:47:37,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17b18ff1/1a751326bd004fa9981c0f21acf7e7ce [2022-02-20 18:47:37,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:47:37,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:47:37,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:47:37,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:47:37,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:47:37,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d3f249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37, skipping insertion in model container [2022-02-20 18:47:37,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:47:37,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:47:37,458 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2022-02-20 18:47:37,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:47:37,573 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:47:37,633 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2022-02-20 18:47:37,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:47:37,699 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:47:37,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37 WrapperNode [2022-02-20 18:47:37,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:47:37,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:47:37,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:47:37,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:47:37,707 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:47:37" (1/1) ... [2022-02-20 18:47:37,730 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:47:37" (1/1) ... [2022-02-20 18:47:37,798 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 805 [2022-02-20 18:47:37,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:47:37,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:47:37,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:47:37,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:47:37,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:47:37,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:47:37,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:47:37,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:47:37,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (1/1) ... [2022-02-20 18:47:37,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:47:37,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:47:37,916 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:47:37,927 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:47:37,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:47:37,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:47:37,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:47:37,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:47:38,082 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:47:38,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:47:38,889 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:47:38,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:47:38,909 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:47:38,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:47:38 BoogieIcfgContainer [2022-02-20 18:47:38,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:47:38,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:47:38,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:47:38,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:47:38,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:47:37" (1/3) ... [2022-02-20 18:47:38,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4757d948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:47:38, skipping insertion in model container [2022-02-20 18:47:38,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:47:37" (2/3) ... [2022-02-20 18:47:38,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4757d948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:47:38, skipping insertion in model container [2022-02-20 18:47:38,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:47:38" (3/3) ... [2022-02-20 18:47:38,934 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:47:38,938 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:47:38,939 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:47:38,978 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:47:38,983 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:47:38,983 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:47:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 214 states have (on average 1.719626168224299) internal successors, (368), 215 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call 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:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:47:39,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:39,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:39,016 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash -981857485, now seen corresponding path program 1 times [2022-02-20 18:47:39,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:39,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486620683] [2022-02-20 18:47:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:39,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#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(66, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_59448~0 := 0;~__return_59568~0 := 0;~__tmp_59727_0~0 := 0;~__return_59759~0 := 0;~__return_59773~0 := 0; {219#true} is VALID [2022-02-20 18:47:39,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {219#true} is VALID [2022-02-20 18:47:39,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume 0 == ~r1~0; {219#true} is VALID [2022-02-20 18:47:39,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {219#true} is VALID [2022-02-20 18:47:39,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {219#true} assume ~id1~0 >= 0; {219#true} is VALID [2022-02-20 18:47:39,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} assume 0 == ~st1~0; {221#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:39,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {221#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:39,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {221#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {221#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:39,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(<= ~st1~0 0)} assume ~id2~0 >= 0; {221#(<= ~st1~0 0)} is VALID [2022-02-20 18:47:39,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(<= ~st1~0 0)} assume 0 == ~st2~0; {222#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {222#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {222#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {222#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {222#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {222#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {223#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {224#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_59448~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_59448~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive5~0 % 256); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,579 INFO L290 TraceCheckUtils]: 57: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_59568~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_59568~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; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,581 INFO L290 TraceCheckUtils]: 59: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,586 INFO L290 TraceCheckUtils]: 66: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;~__tmp_59727_0~0 := main_~main____CPAchecker_TMP_0~0#1; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_59727_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,590 INFO L290 TraceCheckUtils]: 73: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,591 INFO L290 TraceCheckUtils]: 74: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,592 INFO L290 TraceCheckUtils]: 75: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,592 INFO L290 TraceCheckUtils]: 76: Hoare triple {225#(<= (+ ~st5~0 ~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:47:39,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {225#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {220#false} is VALID [2022-02-20 18:47:39,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {220#false} ~__return_59759~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_59759~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {220#false} is VALID [2022-02-20 18:47:39,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {220#false} assume 0 == main_~assert__arg~1#1 % 256; {220#false} is VALID [2022-02-20 18:47:39,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-02-20 18:47:39,596 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:39,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:39,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486620683] [2022-02-20 18:47:39,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486620683] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:39,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:39,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:47:39,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860400351] [2022-02-20 18:47:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 18:47:39,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:39,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:39,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:39,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:47:39,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:39,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:47:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:47:39,709 INFO L87 Difference]: Start difference. First operand has 216 states, 214 states have (on average 1.719626168224299) internal successors, (368), 215 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:42,299 INFO L93 Difference]: Finished difference Result 868 states and 1404 transitions. [2022-02-20 18:47:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:47:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 18:47:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1404 transitions. [2022-02-20 18:47:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1404 transitions. [2022-02-20 18:47:42,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1404 transitions. [2022-02-20 18:47:43,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1404 edges. 1404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:43,573 INFO L225 Difference]: With dead ends: 868 [2022-02-20 18:47:43,573 INFO L226 Difference]: Without dead ends: 748 [2022-02-20 18:47:43,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:47:43,580 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 2252 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:43,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2252 Valid, 2341 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-02-20 18:47:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 329. [2022-02-20 18:47:43,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:43,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 748 states. Second operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call 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:43,803 INFO L74 IsIncluded]: Start isIncluded. First operand 748 states. Second operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call 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:43,808 INFO L87 Difference]: Start difference. First operand 748 states. Second operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call 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:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:43,849 INFO L93 Difference]: Finished difference Result 748 states and 1154 transitions. [2022-02-20 18:47:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1154 transitions. [2022-02-20 18:47:43,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:43,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:43,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 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 748 states. [2022-02-20 18:47:43,860 INFO L87 Difference]: Start difference. First operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 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 748 states. [2022-02-20 18:47:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:43,898 INFO L93 Difference]: Finished difference Result 748 states and 1154 transitions. [2022-02-20 18:47:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1154 transitions. [2022-02-20 18:47:43,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:43,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:43,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:43,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call 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:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 492 transitions. [2022-02-20 18:47:43,934 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 492 transitions. Word has length 81 [2022-02-20 18:47:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:43,935 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 492 transitions. [2022-02-20 18:47:43,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 492 transitions. [2022-02-20 18:47:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:47:43,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:43,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:43,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:47:43,940 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:43,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash -651776507, now seen corresponding path program 1 times [2022-02-20 18:47:43,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:43,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67537012] [2022-02-20 18:47:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:44,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {3322#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(66, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_59448~0 := 0;~__return_59568~0 := 0;~__tmp_59727_0~0 := 0;~__return_59759~0 := 0;~__return_59773~0 := 0; {3322#true} is VALID [2022-02-20 18:47:44,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {3322#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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {3322#true} is VALID [2022-02-20 18:47:44,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {3322#true} assume 0 == ~r1~0; {3322#true} is VALID [2022-02-20 18:47:44,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {3322#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_59448~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_59448~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:47:44,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {3324#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:44,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:44,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:44,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:47:44,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {3325#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:44,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:44,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:44,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:47:44,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {3326#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:47:44,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:47:44,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:47:44,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:47:44,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {3327#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:47:44,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:47:44,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:47:44,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~mode5~0 % 256); {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:47:44,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {3328#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~alive5~0 % 256); {3323#false} is VALID [2022-02-20 18:47:44,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {3323#false} assume !(~send5~0 != ~id5~0); {3323#false} is VALID [2022-02-20 18:47:44,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {3323#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3323#false} is VALID [2022-02-20 18:47:44,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {3323#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3323#false} is VALID [2022-02-20 18:47:44,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {3323#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_59568~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_59568~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; {3323#false} is VALID [2022-02-20 18:47:44,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {3323#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {3323#false} is VALID [2022-02-20 18:47:44,205 INFO L290 TraceCheckUtils]: 59: Hoare triple {3323#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {3323#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {3323#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3323#false} is VALID [2022-02-20 18:47:44,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {3323#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {3323#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {3323#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3323#false} is VALID [2022-02-20 18:47:44,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {3323#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {3323#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {3323#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {3323#false} is VALID [2022-02-20 18:47:44,207 INFO L290 TraceCheckUtils]: 68: Hoare triple {3323#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,207 INFO L290 TraceCheckUtils]: 69: Hoare triple {3323#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {3323#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3323#false} is VALID [2022-02-20 18:47:44,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {3323#false} ~mode4~0 := 0;~__tmp_59727_0~0 := main_~main____CPAchecker_TMP_0~0#1; {3323#false} is VALID [2022-02-20 18:47:44,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {3323#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_59727_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {3323#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3323#false} is VALID [2022-02-20 18:47:44,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {3323#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3323#false} is VALID [2022-02-20 18:47:44,209 INFO L290 TraceCheckUtils]: 75: Hoare triple {3323#false} ~mode5~0 := 0; {3323#false} is VALID [2022-02-20 18:47:44,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {3323#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {3323#false} is VALID [2022-02-20 18:47:44,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {3323#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3323#false} is VALID [2022-02-20 18:47:44,209 INFO L290 TraceCheckUtils]: 78: Hoare triple {3323#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {3323#false} is VALID [2022-02-20 18:47:44,210 INFO L290 TraceCheckUtils]: 79: Hoare triple {3323#false} ~__return_59759~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_59759~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {3323#false} is VALID [2022-02-20 18:47:44,210 INFO L290 TraceCheckUtils]: 80: Hoare triple {3323#false} assume 0 == main_~assert__arg~1#1 % 256; {3323#false} is VALID [2022-02-20 18:47:44,210 INFO L290 TraceCheckUtils]: 81: Hoare triple {3323#false} assume !false; {3323#false} is VALID [2022-02-20 18:47:44,211 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:44,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:44,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67537012] [2022-02-20 18:47:44,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67537012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:44,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:44,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:47:44,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684300805] [2022-02-20 18:47:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:44,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-20 18:47:44,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:44,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:44,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:44,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:47:44,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:47:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:47:44,293 INFO L87 Difference]: Start difference. First operand 329 states and 492 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:47,699 INFO L93 Difference]: Finished difference Result 1425 states and 2199 transitions. [2022-02-20 18:47:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:47:47,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-20 18:47:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1253 transitions. [2022-02-20 18:47:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1253 transitions. [2022-02-20 18:47:47,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1253 transitions. [2022-02-20 18:47:48,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1253 edges. 1253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:48,785 INFO L225 Difference]: With dead ends: 1425 [2022-02-20 18:47:48,786 INFO L226 Difference]: Without dead ends: 1177 [2022-02-20 18:47:48,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:47:48,788 INFO L933 BasicCegarLoop]: 873 mSDtfsCounter, 1052 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:48,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1052 Valid, 2442 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:47:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-02-20 18:47:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1169. [2022-02-20 18:47:49,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:49,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1177 states. Second operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call 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:49,637 INFO L74 IsIncluded]: Start isIncluded. First operand 1177 states. Second operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call 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:49,640 INFO L87 Difference]: Start difference. First operand 1177 states. Second operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call 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:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:49,711 INFO L93 Difference]: Finished difference Result 1177 states and 1801 transitions. [2022-02-20 18:47:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1801 transitions. [2022-02-20 18:47:49,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:49,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:49,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 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 1177 states. [2022-02-20 18:47:49,722 INFO L87 Difference]: Start difference. First operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 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 1177 states. [2022-02-20 18:47:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:49,794 INFO L93 Difference]: Finished difference Result 1177 states and 1801 transitions. [2022-02-20 18:47:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1801 transitions. [2022-02-20 18:47:49,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:49,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:49,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:49,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call 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:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1797 transitions. [2022-02-20 18:47:49,903 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1797 transitions. Word has length 82 [2022-02-20 18:47:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:49,906 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1797 transitions. [2022-02-20 18:47:49,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1797 transitions. [2022-02-20 18:47:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 18:47:49,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:49,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:49,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:47:49,908 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash 994859382, now seen corresponding path program 1 times [2022-02-20 18:47:49,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:49,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805748779] [2022-02-20 18:47:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:50,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {9139#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(66, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_59448~0 := 0;~__return_59568~0 := 0;~__tmp_59727_0~0 := 0;~__return_59759~0 := 0;~__return_59773~0 := 0; {9141#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:50,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {9141#(<= (+ ~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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {9141#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:50,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {9141#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {9141#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:50,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {9141#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {9141#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:50,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {9141#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {9142#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:47:50,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {9142#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {9142#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:47:50,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {9142#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_59448~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_59448~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9143#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:47:50,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {9143#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {9140#false} is VALID [2022-02-20 18:47:50,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {9140#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); {9140#false} is VALID [2022-02-20 18:47:50,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {9140#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {9140#false} assume !!(0 == ~mode2~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {9140#false} assume !!(0 == ~alive2~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {9140#false} assume !(~send2~0 != ~id2~0); {9140#false} is VALID [2022-02-20 18:47:50,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {9140#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {9140#false} assume !!(0 == ~mode3~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {9140#false} assume !!(0 == ~alive3~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {9140#false} assume !(~send3~0 != ~id3~0); {9140#false} is VALID [2022-02-20 18:47:50,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {9140#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {9140#false} assume !!(0 == ~mode4~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {9140#false} assume !!(0 == ~alive4~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {9140#false} assume !(~send4~0 != ~id4~0); {9140#false} is VALID [2022-02-20 18:47:50,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {9140#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {9140#false} assume !!(0 == ~mode5~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {9140#false} assume !!(0 == ~alive5~0 % 256); {9140#false} is VALID [2022-02-20 18:47:50,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {9140#false} assume !(~send5~0 != ~id5~0); {9140#false} is VALID [2022-02-20 18:47:50,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {9140#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {9140#false} is VALID [2022-02-20 18:47:50,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {9140#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {9140#false} is VALID [2022-02-20 18:47:50,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {9140#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_59568~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_59568~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; {9140#false} is VALID [2022-02-20 18:47:50,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {9140#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {9140#false} is VALID [2022-02-20 18:47:50,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {9140#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {9140#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {9140#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {9140#false} is VALID [2022-02-20 18:47:50,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {9140#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {9140#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {9140#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {9140#false} is VALID [2022-02-20 18:47:50,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {9140#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {9140#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {9140#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {9140#false} is VALID [2022-02-20 18:47:50,095 INFO L290 TraceCheckUtils]: 69: Hoare triple {9140#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {9140#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {9140#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {9140#false} is VALID [2022-02-20 18:47:50,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {9140#false} ~mode4~0 := 0;~__tmp_59727_0~0 := main_~main____CPAchecker_TMP_0~0#1; {9140#false} is VALID [2022-02-20 18:47:50,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {9140#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_59727_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {9140#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {9140#false} is VALID [2022-02-20 18:47:50,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {9140#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {9140#false} is VALID [2022-02-20 18:47:50,099 INFO L290 TraceCheckUtils]: 76: Hoare triple {9140#false} ~mode5~0 := 0; {9140#false} is VALID [2022-02-20 18:47:50,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {9140#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {9140#false} is VALID [2022-02-20 18:47:50,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {9140#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {9140#false} is VALID [2022-02-20 18:47:50,099 INFO L290 TraceCheckUtils]: 79: Hoare triple {9140#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {9140#false} is VALID [2022-02-20 18:47:50,100 INFO L290 TraceCheckUtils]: 80: Hoare triple {9140#false} ~__return_59759~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_59759~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {9140#false} is VALID [2022-02-20 18:47:50,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {9140#false} assume 0 == main_~assert__arg~1#1 % 256; {9140#false} is VALID [2022-02-20 18:47:50,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {9140#false} assume !false; {9140#false} is VALID [2022-02-20 18:47:50,102 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:50,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:50,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805748779] [2022-02-20 18:47:50,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805748779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:50,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:50,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:47:50,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977346152] [2022-02-20 18:47:50,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:50,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:47:50,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:50,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:50,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:50,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:50,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:50,159 INFO L87 Difference]: Start difference. First operand 1169 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:53,882 INFO L93 Difference]: Finished difference Result 3226 states and 5017 transitions. [2022-02-20 18:47:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:53,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:47:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2022-02-20 18:47:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2022-02-20 18:47:53,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 755 transitions. [2022-02-20 18:47:54,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 755 edges. 755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:54,629 INFO L225 Difference]: With dead ends: 3226 [2022-02-20 18:47:54,629 INFO L226 Difference]: Without dead ends: 2100 [2022-02-20 18:47:54,631 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:54,632 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 1223 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:54,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1223 Valid, 290 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:47:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-02-20 18:47:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2022-02-20 18:47:56,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:56,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2100 states. Second operand has 2098 states, 2097 states have (on average 1.547925608011445) internal successors, (3246), 2097 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call 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:56,849 INFO L74 IsIncluded]: Start isIncluded. First operand 2100 states. Second operand has 2098 states, 2097 states have (on average 1.547925608011445) internal successors, (3246), 2097 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call 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:56,853 INFO L87 Difference]: Start difference. First operand 2100 states. Second operand has 2098 states, 2097 states have (on average 1.547925608011445) internal successors, (3246), 2097 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call 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:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:57,068 INFO L93 Difference]: Finished difference Result 2100 states and 3247 transitions. [2022-02-20 18:47:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3247 transitions. [2022-02-20 18:47:57,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:57,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:57,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 2098 states, 2097 states have (on average 1.547925608011445) internal successors, (3246), 2097 states have internal predecessors, (3246), 0 states have call successors, (0), 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 2100 states. [2022-02-20 18:47:57,082 INFO L87 Difference]: Start difference. First operand has 2098 states, 2097 states have (on average 1.547925608011445) internal successors, (3246), 2097 states have internal predecessors, (3246), 0 states have call successors, (0), 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 2100 states. [2022-02-20 18:47:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:57,285 INFO L93 Difference]: Finished difference Result 2100 states and 3247 transitions. [2022-02-20 18:47:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3247 transitions. [2022-02-20 18:47:57,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:57,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:57,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:57,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.547925608011445) internal successors, (3246), 2097 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call 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:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3246 transitions. [2022-02-20 18:47:57,590 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3246 transitions. Word has length 83 [2022-02-20 18:47:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:47:57,590 INFO L470 AbstractCegarLoop]: Abstraction has 2098 states and 3246 transitions. [2022-02-20 18:47:57,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3246 transitions. [2022-02-20 18:47:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 18:47:57,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:47:57,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:47:57,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:47:57,595 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:47:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:47:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1568078791, now seen corresponding path program 1 times [2022-02-20 18:47:57,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:47:57,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144484499] [2022-02-20 18:47:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:47:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:47:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:47:57,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {20522#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(66, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_59448~0 := 0;~__return_59568~0 := 0;~__tmp_59727_0~0 := 0;~__return_59759~0 := 0;~__return_59773~0 := 0; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {20524#(<= (+ ~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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {20524#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {20524#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {20524#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {20524#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {20524#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {20524#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {20524#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:47:57,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {20524#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {20525#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:47:57,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {20525#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {20525#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:47:57,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {20525#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_59448~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_59448~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20526#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:47:57,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {20526#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {20523#false} is VALID [2022-02-20 18:47:57,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {20523#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {20523#false} is VALID [2022-02-20 18:47:57,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {20523#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {20523#false} assume !!(0 == ~mode3~0 % 256); {20523#false} is VALID [2022-02-20 18:47:57,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {20523#false} assume !!(0 == ~alive3~0 % 256); {20523#false} is VALID [2022-02-20 18:47:57,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {20523#false} assume !(~send3~0 != ~id3~0); {20523#false} is VALID [2022-02-20 18:47:57,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {20523#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {20523#false} assume !!(0 == ~mode4~0 % 256); {20523#false} is VALID [2022-02-20 18:47:57,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {20523#false} assume !!(0 == ~alive4~0 % 256); {20523#false} is VALID [2022-02-20 18:47:57,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {20523#false} assume !(~send4~0 != ~id4~0); {20523#false} is VALID [2022-02-20 18:47:57,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {20523#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {20523#false} assume !!(0 == ~mode5~0 % 256); {20523#false} is VALID [2022-02-20 18:47:57,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {20523#false} assume !!(0 == ~alive5~0 % 256); {20523#false} is VALID [2022-02-20 18:47:57,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {20523#false} assume !(~send5~0 != ~id5~0); {20523#false} is VALID [2022-02-20 18:47:57,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {20523#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {20523#false} is VALID [2022-02-20 18:47:57,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {20523#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {20523#false} is VALID [2022-02-20 18:47:57,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {20523#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_59568~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_59568~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; {20523#false} is VALID [2022-02-20 18:47:57,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {20523#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {20523#false} is VALID [2022-02-20 18:47:57,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {20523#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {20523#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {20523#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {20523#false} is VALID [2022-02-20 18:47:57,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {20523#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {20523#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {20523#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {20523#false} is VALID [2022-02-20 18:47:57,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {20523#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {20523#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {20523#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {20523#false} is VALID [2022-02-20 18:47:57,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {20523#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {20523#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,755 INFO L290 TraceCheckUtils]: 71: Hoare triple {20523#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {20523#false} is VALID [2022-02-20 18:47:57,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {20523#false} ~mode4~0 := 0;~__tmp_59727_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20523#false} is VALID [2022-02-20 18:47:57,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {20523#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_59727_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,756 INFO L290 TraceCheckUtils]: 74: Hoare triple {20523#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {20523#false} is VALID [2022-02-20 18:47:57,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {20523#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {20523#false} is VALID [2022-02-20 18:47:57,756 INFO L290 TraceCheckUtils]: 76: Hoare triple {20523#false} ~mode5~0 := 0; {20523#false} is VALID [2022-02-20 18:47:57,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {20523#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {20523#false} is VALID [2022-02-20 18:47:57,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {20523#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {20523#false} is VALID [2022-02-20 18:47:57,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {20523#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {20523#false} is VALID [2022-02-20 18:47:57,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {20523#false} ~__return_59759~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_59759~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {20523#false} is VALID [2022-02-20 18:47:57,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {20523#false} assume 0 == main_~assert__arg~1#1 % 256; {20523#false} is VALID [2022-02-20 18:47:57,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {20523#false} assume !false; {20523#false} is VALID [2022-02-20 18:47:57,759 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:57,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:47:57,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144484499] [2022-02-20 18:47:57,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144484499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:47:57,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:47:57,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:47:57,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611481493] [2022-02-20 18:47:57,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:47:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:47:57,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:47:57,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:57,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:57,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:47:57,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:47:57,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:47:57,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:47:57,814 INFO L87 Difference]: Start difference. First operand 2098 states and 3246 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:05,096 INFO L93 Difference]: Finished difference Result 5896 states and 9184 transitions. [2022-02-20 18:48:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:05,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:48:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2022-02-20 18:48:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2022-02-20 18:48:05,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 729 transitions. [2022-02-20 18:48:05,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:06,161 INFO L225 Difference]: With dead ends: 5896 [2022-02-20 18:48:06,162 INFO L226 Difference]: Without dead ends: 3857 [2022-02-20 18:48:06,164 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:48:06,175 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1187 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:06,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1187 Valid, 294 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2022-02-20 18:48:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3855. [2022-02-20 18:48:11,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:11,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3857 states. Second operand has 3855 states, 3854 states have (on average 1.5490399584846912) internal successors, (5970), 3854 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call 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:11,360 INFO L74 IsIncluded]: Start isIncluded. First operand 3857 states. Second operand has 3855 states, 3854 states have (on average 1.5490399584846912) internal successors, (5970), 3854 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call 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:11,366 INFO L87 Difference]: Start difference. First operand 3857 states. Second operand has 3855 states, 3854 states have (on average 1.5490399584846912) internal successors, (5970), 3854 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call 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:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:11,844 INFO L93 Difference]: Finished difference Result 3857 states and 5971 transitions. [2022-02-20 18:48:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 5971 transitions. [2022-02-20 18:48:11,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:11,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:11,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 3855 states, 3854 states have (on average 1.5490399584846912) internal successors, (5970), 3854 states have internal predecessors, (5970), 0 states have call successors, (0), 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 3857 states. [2022-02-20 18:48:11,862 INFO L87 Difference]: Start difference. First operand has 3855 states, 3854 states have (on average 1.5490399584846912) internal successors, (5970), 3854 states have internal predecessors, (5970), 0 states have call successors, (0), 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 3857 states. [2022-02-20 18:48:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:12,347 INFO L93 Difference]: Finished difference Result 3857 states and 5971 transitions. [2022-02-20 18:48:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 5971 transitions. [2022-02-20 18:48:12,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:12,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:12,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:12,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3854 states have (on average 1.5490399584846912) internal successors, (5970), 3854 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call 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:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 5970 transitions. [2022-02-20 18:48:13,055 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 5970 transitions. Word has length 83 [2022-02-20 18:48:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:13,055 INFO L470 AbstractCegarLoop]: Abstraction has 3855 states and 5970 transitions. [2022-02-20 18:48:13,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 5970 transitions. [2022-02-20 18:48:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 18:48:13,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:13,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:13,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:48:13,059 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2053901352, now seen corresponding path program 1 times [2022-02-20 18:48:13,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:13,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34189357] [2022-02-20 18:48:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:13,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {41508#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(66, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_59448~0 := 0;~__return_59568~0 := 0;~__tmp_59727_0~0 := 0;~__return_59759~0 := 0;~__return_59773~0 := 0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {41510#(<= (+ ~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_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {41510#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:13,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {41510#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {41511#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:48:13,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {41511#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {41511#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:48:13,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {41511#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 >= 0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st5~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send5~0 == ~id5~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode5~0 % 256; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id5~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id5~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id5~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_59448~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_59448~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send1~0 != ~id1~0); {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {41512#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:13,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {41512#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {41509#false} is VALID [2022-02-20 18:48:13,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {41509#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {41509#false} is VALID [2022-02-20 18:48:13,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {41509#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {41509#false} assume !!(0 == ~mode4~0 % 256); {41509#false} is VALID [2022-02-20 18:48:13,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {41509#false} assume !!(0 == ~alive4~0 % 256); {41509#false} is VALID [2022-02-20 18:48:13,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {41509#false} assume !(~send4~0 != ~id4~0); {41509#false} is VALID [2022-02-20 18:48:13,187 INFO L290 TraceCheckUtils]: 52: Hoare triple {41509#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {41509#false} assume !!(0 == ~mode5~0 % 256); {41509#false} is VALID [2022-02-20 18:48:13,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {41509#false} assume !!(0 == ~alive5~0 % 256); {41509#false} is VALID [2022-02-20 18:48:13,188 INFO L290 TraceCheckUtils]: 55: Hoare triple {41509#false} assume !(~send5~0 != ~id5~0); {41509#false} is VALID [2022-02-20 18:48:13,188 INFO L290 TraceCheckUtils]: 56: Hoare triple {41509#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {41509#false} is VALID [2022-02-20 18:48:13,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {41509#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {41509#false} is VALID [2022-02-20 18:48:13,188 INFO L290 TraceCheckUtils]: 58: Hoare triple {41509#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_59568~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_59568~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; {41509#false} is VALID [2022-02-20 18:48:13,188 INFO L290 TraceCheckUtils]: 59: Hoare triple {41509#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {41509#false} is VALID [2022-02-20 18:48:13,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {41509#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {41509#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {41509#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {41509#false} is VALID [2022-02-20 18:48:13,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {41509#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,189 INFO L290 TraceCheckUtils]: 64: Hoare triple {41509#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {41509#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {41509#false} is VALID [2022-02-20 18:48:13,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {41509#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {41509#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,190 INFO L290 TraceCheckUtils]: 68: Hoare triple {41509#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {41509#false} is VALID [2022-02-20 18:48:13,190 INFO L290 TraceCheckUtils]: 69: Hoare triple {41509#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,190 INFO L290 TraceCheckUtils]: 70: Hoare triple {41509#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,190 INFO L290 TraceCheckUtils]: 71: Hoare triple {41509#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {41509#false} is VALID [2022-02-20 18:48:13,190 INFO L290 TraceCheckUtils]: 72: Hoare triple {41509#false} ~mode4~0 := 0;~__tmp_59727_0~0 := main_~main____CPAchecker_TMP_0~0#1; {41509#false} is VALID [2022-02-20 18:48:13,190 INFO L290 TraceCheckUtils]: 73: Hoare triple {41509#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_59727_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,191 INFO L290 TraceCheckUtils]: 74: Hoare triple {41509#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {41509#false} is VALID [2022-02-20 18:48:13,191 INFO L290 TraceCheckUtils]: 75: Hoare triple {41509#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {41509#false} is VALID [2022-02-20 18:48:13,191 INFO L290 TraceCheckUtils]: 76: Hoare triple {41509#false} ~mode5~0 := 0; {41509#false} is VALID [2022-02-20 18:48:13,191 INFO L290 TraceCheckUtils]: 77: Hoare triple {41509#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {41509#false} is VALID [2022-02-20 18:48:13,191 INFO L290 TraceCheckUtils]: 78: Hoare triple {41509#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {41509#false} is VALID [2022-02-20 18:48:13,191 INFO L290 TraceCheckUtils]: 79: Hoare triple {41509#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {41509#false} is VALID [2022-02-20 18:48:13,192 INFO L290 TraceCheckUtils]: 80: Hoare triple {41509#false} ~__return_59759~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_59759~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {41509#false} is VALID [2022-02-20 18:48:13,192 INFO L290 TraceCheckUtils]: 81: Hoare triple {41509#false} assume 0 == main_~assert__arg~1#1 % 256; {41509#false} is VALID [2022-02-20 18:48:13,192 INFO L290 TraceCheckUtils]: 82: Hoare triple {41509#false} assume !false; {41509#false} is VALID [2022-02-20 18:48:13,192 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:48:13,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:13,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34189357] [2022-02-20 18:48:13,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34189357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:13,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:13,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:13,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756315275] [2022-02-20 18:48:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:48:13,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:13,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:13,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:13,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:13,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:13,263 INFO L87 Difference]: Start difference. First operand 3855 states and 5970 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:30,171 INFO L93 Difference]: Finished difference Result 10980 states and 17065 transitions. [2022-02-20 18:48:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:30,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:48:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2022-02-20 18:48:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call 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:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2022-02-20 18:48:30,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 703 transitions. [2022-02-20 18:48:30,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 703 edges. 703 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:32,694 INFO L225 Difference]: With dead ends: 10980 [2022-02-20 18:48:32,694 INFO L226 Difference]: Without dead ends: 7207 [2022-02-20 18:48:32,698 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:48:32,704 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1149 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:32,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 296 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states.