./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.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/pals_lcr.5.1.ufo.UNBOUNDED.pals.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 6382bf7d3923cc5e5d05cc0b7a660c702c8db87925ef073e0a0a8704a68a4a3b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:29:40,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:29:40,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:29:40,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:29:40,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:29:40,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:29:40,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:29:40,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:29:40,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:29:40,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:29:40,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:29:40,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:29:40,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:29:40,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:29:40,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:29:40,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:29:40,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:29:40,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:29:40,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:29:40,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:29:40,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:29:40,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:29:40,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:29:40,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:29:40,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:29:40,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:29:40,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:29:40,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:29:40,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:29:40,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:29:40,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:29:40,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:29:40,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:29:40,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:29:40,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:29:40,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:29:40,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:29:40,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:29:40,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:29:40,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:29:40,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:29:40,188 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:29:40,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:29:40,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:29:40,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:29:40,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:29:40,202 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:29:40,202 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:29:40,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:29:40,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:29:40,203 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:29:40,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:29:40,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:29:40,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:29:40,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:29:40,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:29:40,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:29:40,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:29:40,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:29:40,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:29:40,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:29:40,207 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:29:40,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:29:40,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:29:40,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:29:40,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:29:40,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:40,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:29:40,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:29:40,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:29:40,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:29:40,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:29:40,209 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:29:40,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:29:40,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:29:40,209 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 -> 6382bf7d3923cc5e5d05cc0b7a660c702c8db87925ef073e0a0a8704a68a4a3b [2022-02-20 18:29:40,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:29:40,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:29:40,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:29:40,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:29:40,430 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:29:40,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:40,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d20b53aba/1e3fc8484961465c953c73b90547ad33/FLAG740876ffe [2022-02-20 18:29:40,868 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:29:40,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:40,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d20b53aba/1e3fc8484961465c953c73b90547ad33/FLAG740876ffe [2022-02-20 18:29:40,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d20b53aba/1e3fc8484961465c953c73b90547ad33 [2022-02-20 18:29:40,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:29:40,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:29:40,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:40,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:29:40,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:29:40,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:40" (1/1) ... [2022-02-20 18:29:40,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e44f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:40, skipping insertion in model container [2022-02-20 18:29:40,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:40" (1/1) ... [2022-02-20 18:29:40,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:29:40,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:29:41,113 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/pals_lcr.5.1.ufo.UNBOUNDED.pals.c[11298,11311] [2022-02-20 18:29:41,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:41,121 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:29:41,152 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/pals_lcr.5.1.ufo.UNBOUNDED.pals.c[11298,11311] [2022-02-20 18:29:41,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:41,162 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:29:41,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41 WrapperNode [2022-02-20 18:29:41,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:41,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:41,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:29:41,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:29:41,173 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:29:41" (1/1) ... [2022-02-20 18:29:41,180 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:29:41" (1/1) ... [2022-02-20 18:29:41,211 INFO L137 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 332 [2022-02-20 18:29:41,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:41,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:29:41,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:29:41,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:29:41,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:29:41,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:29:41,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:29:41,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:29:41,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (1/1) ... [2022-02-20 18:29:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:41,283 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:29:41,284 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:29:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:29:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:29:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:29:41,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:29:41,422 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:29:41,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:29:41,900 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:29:41,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:29:41,905 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:29:41,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:41 BoogieIcfgContainer [2022-02-20 18:29:41,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:29:41,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:29:41,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:29:41,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:29:41,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:29:40" (1/3) ... [2022-02-20 18:29:41,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a72b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:41, skipping insertion in model container [2022-02-20 18:29:41,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:41" (2/3) ... [2022-02-20 18:29:41,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a72b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:41, skipping insertion in model container [2022-02-20 18:29:41,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:41" (3/3) ... [2022-02-20 18:29:41,913 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:41,916 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:29:41,916 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:29:41,947 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:29:41,952 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:29:41,953 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:29:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 94 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:29:41,971 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:41,972 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] [2022-02-20 18:29:41,972 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -176333024, now seen corresponding path program 1 times [2022-02-20 18:29:41,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:41,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728584188] [2022-02-20 18:29:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:42,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {98#true} is VALID [2022-02-20 18:29:42,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {98#true} is VALID [2022-02-20 18:29:42,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {98#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {98#true} is VALID [2022-02-20 18:29:42,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {98#true} init_#res#1 := init_~tmp~0#1; {98#true} is VALID [2022-02-20 18:29:42,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {98#true} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {98#true} is VALID [2022-02-20 18:29:42,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {98#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {99#false} is VALID [2022-02-20 18:29:42,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {99#false} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {99#false} is VALID [2022-02-20 18:29:42,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {99#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {99#false} is VALID [2022-02-20 18:29:42,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {99#false} assume !(0 != ~mode1~0 % 256); {99#false} is VALID [2022-02-20 18:29:42,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {99#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {99#false} is VALID [2022-02-20 18:29:42,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {99#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {99#false} is VALID [2022-02-20 18:29:42,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {99#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {99#false} is VALID [2022-02-20 18:29:42,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {99#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {99#false} is VALID [2022-02-20 18:29:42,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#false} assume !(node2_~m2~0#1 != ~nomsg~0); {99#false} is VALID [2022-02-20 18:29:42,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {99#false} ~mode2~0 := 0; {99#false} is VALID [2022-02-20 18:29:42,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {99#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {99#false} is VALID [2022-02-20 18:29:42,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {99#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {99#false} is VALID [2022-02-20 18:29:42,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {99#false} assume !(node3_~m3~0#1 != ~nomsg~0); {99#false} is VALID [2022-02-20 18:29:42,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {99#false} ~mode3~0 := 0; {99#false} is VALID [2022-02-20 18:29:42,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {99#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {99#false} is VALID [2022-02-20 18:29:42,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {99#false} assume !(0 != ~mode4~0 % 256); {99#false} is VALID [2022-02-20 18:29:42,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {99#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {99#false} is VALID [2022-02-20 18:29:42,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {99#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {99#false} is VALID [2022-02-20 18:29:42,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {99#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {99#false} is VALID [2022-02-20 18:29:42,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {99#false} assume !(0 != ~mode5~0 % 256); {99#false} is VALID [2022-02-20 18:29:42,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {99#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {99#false} is VALID [2022-02-20 18:29:42,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {99#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {99#false} is VALID [2022-02-20 18:29:42,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {99#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {99#false} is VALID [2022-02-20 18:29:42,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {99#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {99#false} is VALID [2022-02-20 18:29:42,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {99#false} check_#res#1 := check_~tmp~1#1; {99#false} is VALID [2022-02-20 18:29:42,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {99#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {99#false} is VALID [2022-02-20 18:29:42,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {99#false} assume 0 == assert_~arg#1 % 256; {99#false} is VALID [2022-02-20 18:29:42,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {99#false} assume !false; {99#false} is VALID [2022-02-20 18:29:42,186 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:29:42,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:42,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728584188] [2022-02-20 18:29:42,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728584188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:42,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:42,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:29:42,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818088940] [2022-02-20 18:29:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:42,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:42,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:42,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:29:42,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:29:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:42,248 INFO L87 Difference]: Start difference. First operand has 95 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 94 states have internal predecessors, (160), 0 states have call successors, (0), 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 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,347 INFO L93 Difference]: Finished difference Result 150 states and 249 transitions. [2022-02-20 18:29:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:29:42,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions. [2022-02-20 18:29:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions. [2022-02-20 18:29:42,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 249 transitions. [2022-02-20 18:29:42,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:42,553 INFO L225 Difference]: With dead ends: 150 [2022-02-20 18:29:42,554 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 18:29:42,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:42,559 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:42,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 18:29:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 18:29:42,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:42,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 90 states have (on average 1.7) internal successors, (153), 90 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,583 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 90 states have (on average 1.7) internal successors, (153), 90 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,583 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 90 states have (on average 1.7) internal successors, (153), 90 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,589 INFO L93 Difference]: Finished difference Result 91 states and 153 transitions. [2022-02-20 18:29:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 153 transitions. [2022-02-20 18:29:42,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:42,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:42,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 90 states have (on average 1.7) internal successors, (153), 90 states have internal predecessors, (153), 0 states have call successors, (0), 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 91 states. [2022-02-20 18:29:42,590 INFO L87 Difference]: Start difference. First operand has 91 states, 90 states have (on average 1.7) internal successors, (153), 90 states have internal predecessors, (153), 0 states have call successors, (0), 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 91 states. [2022-02-20 18:29:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,599 INFO L93 Difference]: Finished difference Result 91 states and 153 transitions. [2022-02-20 18:29:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 153 transitions. [2022-02-20 18:29:42,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:42,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:42,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:42,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.7) internal successors, (153), 90 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 153 transitions. [2022-02-20 18:29:42,606 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 153 transitions. Word has length 33 [2022-02-20 18:29:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:42,609 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 153 transitions. [2022-02-20 18:29:42,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 153 transitions. [2022-02-20 18:29:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:29:42,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:42,611 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] [2022-02-20 18:29:42,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:29:42,612 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash -685806114, now seen corresponding path program 1 times [2022-02-20 18:29:42,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:42,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878651072] [2022-02-20 18:29:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:42,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {552#true} is VALID [2022-02-20 18:29:42,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {552#true} is VALID [2022-02-20 18:29:42,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {552#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {554#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:29:42,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {554#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {555#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:29:42,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {555#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {556#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:29:42,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {553#false} is VALID [2022-02-20 18:29:42,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#false} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {553#false} is VALID [2022-02-20 18:29:42,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {553#false} is VALID [2022-02-20 18:29:42,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#false} assume !(0 != ~mode1~0 % 256); {553#false} is VALID [2022-02-20 18:29:42,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {553#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {553#false} is VALID [2022-02-20 18:29:42,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {553#false} is VALID [2022-02-20 18:29:42,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {553#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {553#false} is VALID [2022-02-20 18:29:42,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {553#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {553#false} is VALID [2022-02-20 18:29:42,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {553#false} assume !(node2_~m2~0#1 != ~nomsg~0); {553#false} is VALID [2022-02-20 18:29:42,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {553#false} ~mode2~0 := 0; {553#false} is VALID [2022-02-20 18:29:42,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {553#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {553#false} is VALID [2022-02-20 18:29:42,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {553#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {553#false} is VALID [2022-02-20 18:29:42,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {553#false} assume !(node3_~m3~0#1 != ~nomsg~0); {553#false} is VALID [2022-02-20 18:29:42,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {553#false} ~mode3~0 := 0; {553#false} is VALID [2022-02-20 18:29:42,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {553#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {553#false} is VALID [2022-02-20 18:29:42,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {553#false} assume !(0 != ~mode4~0 % 256); {553#false} is VALID [2022-02-20 18:29:42,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {553#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {553#false} is VALID [2022-02-20 18:29:42,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {553#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {553#false} is VALID [2022-02-20 18:29:42,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {553#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {553#false} is VALID [2022-02-20 18:29:42,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {553#false} assume !(0 != ~mode5~0 % 256); {553#false} is VALID [2022-02-20 18:29:42,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {553#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {553#false} is VALID [2022-02-20 18:29:42,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {553#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {553#false} is VALID [2022-02-20 18:29:42,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {553#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {553#false} is VALID [2022-02-20 18:29:42,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {553#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {553#false} is VALID [2022-02-20 18:29:42,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {553#false} check_#res#1 := check_~tmp~1#1; {553#false} is VALID [2022-02-20 18:29:42,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {553#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {553#false} is VALID [2022-02-20 18:29:42,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {553#false} assume 0 == assert_~arg#1 % 256; {553#false} is VALID [2022-02-20 18:29:42,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {553#false} assume !false; {553#false} is VALID [2022-02-20 18:29:42,702 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:29:42,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:42,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878651072] [2022-02-20 18:29:42,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878651072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:42,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:42,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:42,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194349779] [2022-02-20 18:29:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:42,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:42,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:42,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:42,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:42,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:42,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:42,727 INFO L87 Difference]: Start difference. First operand 91 states and 153 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,036 INFO L93 Difference]: Finished difference Result 149 states and 242 transitions. [2022-02-20 18:29:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2022-02-20 18:29:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2022-02-20 18:29:43,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 242 transitions. [2022-02-20 18:29:43,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:43,191 INFO L225 Difference]: With dead ends: 149 [2022-02-20 18:29:43,191 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 18:29:43,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:43,192 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 3 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:43,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 570 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 18:29:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 18:29:43,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:43,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,197 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,197 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,199 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2022-02-20 18:29:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2022-02-20 18:29:43,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 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 91 states. [2022-02-20 18:29:43,201 INFO L87 Difference]: Start difference. First operand has 91 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 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 91 states. [2022-02-20 18:29:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,203 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2022-02-20 18:29:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2022-02-20 18:29:43,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:43,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-02-20 18:29:43,206 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 33 [2022-02-20 18:29:43,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:43,206 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-02-20 18:29:43,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2022-02-20 18:29:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:43,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:43,208 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] [2022-02-20 18:29:43,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:29:43,208 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 803903125, now seen corresponding path program 1 times [2022-02-20 18:29:43,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:43,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348238618] [2022-02-20 18:29:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:43,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {1012#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {1012#true} is VALID [2022-02-20 18:29:43,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1012#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1012#true} is VALID [2022-02-20 18:29:43,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {1012#true} assume 0 == ~r1~0 % 256; {1012#true} is VALID [2022-02-20 18:29:43,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {1012#true} assume ~id1~0 >= 0; {1012#true} is VALID [2022-02-20 18:29:43,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {1012#true} assume 0 == ~st1~0; {1012#true} is VALID [2022-02-20 18:29:43,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {1012#true} assume ~send1~0 == ~id1~0; {1012#true} is VALID [2022-02-20 18:29:43,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {1012#true} assume 0 == ~mode1~0 % 256; {1012#true} is VALID [2022-02-20 18:29:43,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {1012#true} assume ~id2~0 >= 0; {1012#true} is VALID [2022-02-20 18:29:43,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {1012#true} assume 0 == ~st2~0; {1012#true} is VALID [2022-02-20 18:29:43,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {1012#true} assume ~send2~0 == ~id2~0; {1012#true} is VALID [2022-02-20 18:29:43,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {1012#true} assume 0 == ~mode2~0 % 256; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:43,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {1014#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1013#false} is VALID [2022-02-20 18:29:43,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {1013#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1013#false} is VALID [2022-02-20 18:29:43,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {1013#false} ~mode2~0 := 0; {1013#false} is VALID [2022-02-20 18:29:43,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {1013#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1013#false} is VALID [2022-02-20 18:29:43,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {1013#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1013#false} is VALID [2022-02-20 18:29:43,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {1013#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1013#false} is VALID [2022-02-20 18:29:43,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {1013#false} ~mode3~0 := 0; {1013#false} is VALID [2022-02-20 18:29:43,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {1013#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1013#false} is VALID [2022-02-20 18:29:43,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {1013#false} assume !(0 != ~mode4~0 % 256); {1013#false} is VALID [2022-02-20 18:29:43,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {1013#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {1013#false} is VALID [2022-02-20 18:29:43,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {1013#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {1013#false} is VALID [2022-02-20 18:29:43,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {1013#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1013#false} is VALID [2022-02-20 18:29:43,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {1013#false} assume !(0 != ~mode5~0 % 256); {1013#false} is VALID [2022-02-20 18:29:43,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {1013#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1013#false} is VALID [2022-02-20 18:29:43,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {1013#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1013#false} is VALID [2022-02-20 18:29:43,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {1013#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1013#false} is VALID [2022-02-20 18:29:43,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {1013#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {1013#false} is VALID [2022-02-20 18:29:43,302 INFO L290 TraceCheckUtils]: 59: Hoare triple {1013#false} check_#res#1 := check_~tmp~1#1; {1013#false} is VALID [2022-02-20 18:29:43,302 INFO L290 TraceCheckUtils]: 60: Hoare triple {1013#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1013#false} is VALID [2022-02-20 18:29:43,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {1013#false} assume 0 == assert_~arg#1 % 256; {1013#false} is VALID [2022-02-20 18:29:43,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {1013#false} assume !false; {1013#false} is VALID [2022-02-20 18:29:43,303 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:29:43,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:43,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348238618] [2022-02-20 18:29:43,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348238618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:43,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:43,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:43,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124418877] [2022-02-20 18:29:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:43,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:29:43,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:43,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:43,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:43,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:43,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:43,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:43,344 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,483 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2022-02-20 18:29:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:43,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:29:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:43,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 282 transitions. [2022-02-20 18:29:43,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:43,658 INFO L225 Difference]: With dead ends: 193 [2022-02-20 18:29:43,658 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:29:43,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:43,659 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:43,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 264 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:29:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-02-20 18:29:43,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:43,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 137 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,667 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 137 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,667 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 137 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,670 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-02-20 18:29:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-02-20 18:29:43,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:29:43,671 INFO L87 Difference]: Start difference. First operand has 137 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:29:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,674 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-02-20 18:29:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-02-20 18:29:43,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:43,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 195 transitions. [2022-02-20 18:29:43,680 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 195 transitions. Word has length 63 [2022-02-20 18:29:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:43,682 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 195 transitions. [2022-02-20 18:29:43,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 195 transitions. [2022-02-20 18:29:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:43,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:43,685 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] [2022-02-20 18:29:43,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:29:43,688 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1136127733, now seen corresponding path program 1 times [2022-02-20 18:29:43,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:43,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666658326] [2022-02-20 18:29:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:43,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {1667#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {1667#true} is VALID [2022-02-20 18:29:43,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1667#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1667#true} is VALID [2022-02-20 18:29:43,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#true} assume 0 == ~r1~0 % 256; {1667#true} is VALID [2022-02-20 18:29:43,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {1667#true} assume ~id1~0 >= 0; {1667#true} is VALID [2022-02-20 18:29:43,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {1667#true} assume 0 == ~st1~0; {1667#true} is VALID [2022-02-20 18:29:43,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#true} assume ~send1~0 == ~id1~0; {1667#true} is VALID [2022-02-20 18:29:43,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {1667#true} assume 0 == ~mode1~0 % 256; {1667#true} is VALID [2022-02-20 18:29:43,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#true} assume ~id2~0 >= 0; {1667#true} is VALID [2022-02-20 18:29:43,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#true} assume 0 == ~st2~0; {1667#true} is VALID [2022-02-20 18:29:43,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#true} assume ~send2~0 == ~id2~0; {1667#true} is VALID [2022-02-20 18:29:43,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {1667#true} assume 0 == ~mode2~0 % 256; {1667#true} is VALID [2022-02-20 18:29:43,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#true} assume ~id3~0 >= 0; {1667#true} is VALID [2022-02-20 18:29:43,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#true} assume 0 == ~st3~0; {1667#true} is VALID [2022-02-20 18:29:43,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {1667#true} assume ~send3~0 == ~id3~0; {1667#true} is VALID [2022-02-20 18:29:43,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#true} assume 0 == ~mode3~0 % 256; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {1669#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1668#false} is VALID [2022-02-20 18:29:43,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {1668#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1668#false} is VALID [2022-02-20 18:29:43,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {1668#false} ~mode3~0 := 0; {1668#false} is VALID [2022-02-20 18:29:43,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {1668#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1668#false} is VALID [2022-02-20 18:29:43,780 INFO L290 TraceCheckUtils]: 50: Hoare triple {1668#false} assume !(0 != ~mode4~0 % 256); {1668#false} is VALID [2022-02-20 18:29:43,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {1668#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {1668#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {1668#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {1668#false} assume !(0 != ~mode5~0 % 256); {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {1668#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {1668#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {1668#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {1668#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {1668#false} is VALID [2022-02-20 18:29:43,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {1668#false} check_#res#1 := check_~tmp~1#1; {1668#false} is VALID [2022-02-20 18:29:43,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {1668#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1668#false} is VALID [2022-02-20 18:29:43,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {1668#false} assume 0 == assert_~arg#1 % 256; {1668#false} is VALID [2022-02-20 18:29:43,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {1668#false} assume !false; {1668#false} is VALID [2022-02-20 18:29:43,782 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:29:43,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:43,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666658326] [2022-02-20 18:29:43,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666658326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:43,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:43,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:43,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757498950] [2022-02-20 18:29:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:29:43,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:43,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:43,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:43,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:43,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:43,819 INFO L87 Difference]: Start difference. First operand 137 states and 195 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,954 INFO L93 Difference]: Finished difference Result 325 states and 491 transitions. [2022-02-20 18:29:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:29:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:43,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 282 transitions. [2022-02-20 18:29:44,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:44,120 INFO L225 Difference]: With dead ends: 325 [2022-02-20 18:29:44,120 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 18:29:44,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:44,121 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 67 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:44,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 18:29:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2022-02-20 18:29:44,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:44,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.4864864864864864) internal successors, (330), 222 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,142 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.4864864864864864) internal successors, (330), 222 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,143 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.4864864864864864) internal successors, (330), 222 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,147 INFO L93 Difference]: Finished difference Result 225 states and 331 transitions. [2022-02-20 18:29:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2022-02-20 18:29:44,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:44,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:44,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 222 states have (on average 1.4864864864864864) internal successors, (330), 222 states have internal predecessors, (330), 0 states have call successors, (0), 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 225 states. [2022-02-20 18:29:44,148 INFO L87 Difference]: Start difference. First operand has 223 states, 222 states have (on average 1.4864864864864864) internal successors, (330), 222 states have internal predecessors, (330), 0 states have call successors, (0), 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 225 states. [2022-02-20 18:29:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,153 INFO L93 Difference]: Finished difference Result 225 states and 331 transitions. [2022-02-20 18:29:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2022-02-20 18:29:44,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:44,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:44,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:44,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.4864864864864864) internal successors, (330), 222 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 330 transitions. [2022-02-20 18:29:44,159 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 330 transitions. Word has length 63 [2022-02-20 18:29:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:44,160 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 330 transitions. [2022-02-20 18:29:44,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 330 transitions. [2022-02-20 18:29:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:44,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:44,161 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] [2022-02-20 18:29:44,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:29:44,162 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1564554881, now seen corresponding path program 1 times [2022-02-20 18:29:44,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:44,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553937747] [2022-02-20 18:29:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:44,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {2752#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {2752#true} is VALID [2022-02-20 18:29:44,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {2752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2752#true} is VALID [2022-02-20 18:29:44,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {2752#true} assume 0 == ~r1~0 % 256; {2752#true} is VALID [2022-02-20 18:29:44,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {2752#true} assume ~id1~0 >= 0; {2752#true} is VALID [2022-02-20 18:29:44,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {2752#true} assume 0 == ~st1~0; {2754#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {2754#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2754#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {2754#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2754#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {2754#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2754#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {2754#(<= ~st1~0 0)} assume 0 == ~st2~0; {2755#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {2755#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {2755#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {2755#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {2755#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {2755#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {2755#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {2755#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {2756#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {2757#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {2758#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {2753#false} is VALID [2022-02-20 18:29:44,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {2753#false} check_#res#1 := check_~tmp~1#1; {2753#false} is VALID [2022-02-20 18:29:44,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {2753#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2753#false} is VALID [2022-02-20 18:29:44,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {2753#false} assume 0 == assert_~arg#1 % 256; {2753#false} is VALID [2022-02-20 18:29:44,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {2753#false} assume !false; {2753#false} is VALID [2022-02-20 18:29:44,321 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:29:44,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:44,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553937747] [2022-02-20 18:29:44,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553937747] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:44,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:44,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:29:44,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312890964] [2022-02-20 18:29:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:44,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:29:44,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:44,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:44,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:44,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:29:44,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:29:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:44,358 INFO L87 Difference]: Start difference. First operand 223 states and 330 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:45,929 INFO L93 Difference]: Finished difference Result 2083 states and 3260 transitions. [2022-02-20 18:29:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:29:45,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:29:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 972 transitions. [2022-02-20 18:29:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 972 transitions. [2022-02-20 18:29:45,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 972 transitions. [2022-02-20 18:29:46,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 972 edges. 972 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:46,717 INFO L225 Difference]: With dead ends: 2083 [2022-02-20 18:29:46,717 INFO L226 Difference]: Without dead ends: 1897 [2022-02-20 18:29:46,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:29:46,719 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 1361 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:46,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1361 Valid, 1223 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:29:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-02-20 18:29:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 407. [2022-02-20 18:29:46,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:46,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1897 states. Second operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:46,835 INFO L74 IsIncluded]: Start isIncluded. First operand 1897 states. Second operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:46,836 INFO L87 Difference]: Start difference. First operand 1897 states. Second operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:46,930 INFO L93 Difference]: Finished difference Result 1897 states and 2927 transitions. [2022-02-20 18:29:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2927 transitions. [2022-02-20 18:29:46,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:46,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:46,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 0 states have call successors, (0), 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 1897 states. [2022-02-20 18:29:46,934 INFO L87 Difference]: Start difference. First operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 0 states have call successors, (0), 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 1897 states. [2022-02-20 18:29:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:47,035 INFO L93 Difference]: Finished difference Result 1897 states and 2927 transitions. [2022-02-20 18:29:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2927 transitions. [2022-02-20 18:29:47,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:47,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:47,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:47,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2022-02-20 18:29:47,046 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 63 [2022-02-20 18:29:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:47,046 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2022-02-20 18:29:47,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2022-02-20 18:29:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:29:47,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:47,047 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] [2022-02-20 18:29:47,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:29:47,047 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1117008495, now seen corresponding path program 1 times [2022-02-20 18:29:47,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:47,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932442144] [2022-02-20 18:29:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:47,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {9478#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {9478#true} is VALID [2022-02-20 18:29:47,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {9478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {9478#true} is VALID [2022-02-20 18:29:47,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {9478#true} assume 0 == ~r1~0 % 256; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:47,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {9480#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 5; {9479#false} is VALID [2022-02-20 18:29:47,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {9479#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {9479#false} is VALID [2022-02-20 18:29:47,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {9479#false} check_#res#1 := check_~tmp~1#1; {9479#false} is VALID [2022-02-20 18:29:47,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {9479#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {9479#false} is VALID [2022-02-20 18:29:47,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {9479#false} assume 0 == assert_~arg#1 % 256; {9479#false} is VALID [2022-02-20 18:29:47,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {9479#false} assume !false; {9479#false} is VALID [2022-02-20 18:29:47,117 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:29:47,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:47,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932442144] [2022-02-20 18:29:47,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932442144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:47,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:47,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:47,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61801747] [2022-02-20 18:29:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:47,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:47,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:47,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:47,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:47,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:47,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:47,156 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:47,535 INFO L93 Difference]: Finished difference Result 1103 states and 1692 transitions. [2022-02-20 18:29:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-02-20 18:29:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-02-20 18:29:47,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 283 transitions. [2022-02-20 18:29:47,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:47,711 INFO L225 Difference]: With dead ends: 1103 [2022-02-20 18:29:47,712 INFO L226 Difference]: Without dead ends: 733 [2022-02-20 18:29:47,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:47,713 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:47,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 196 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-02-20 18:29:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 723. [2022-02-20 18:29:47,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:47,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 733 states. Second operand has 723 states, 722 states have (on average 1.5041551246537397) internal successors, (1086), 722 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,929 INFO L74 IsIncluded]: Start isIncluded. First operand 733 states. Second operand has 723 states, 722 states have (on average 1.5041551246537397) internal successors, (1086), 722 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,930 INFO L87 Difference]: Start difference. First operand 733 states. Second operand has 723 states, 722 states have (on average 1.5041551246537397) internal successors, (1086), 722 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:47,946 INFO L93 Difference]: Finished difference Result 733 states and 1095 transitions. [2022-02-20 18:29:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1095 transitions. [2022-02-20 18:29:47,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:47,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:47,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 723 states, 722 states have (on average 1.5041551246537397) internal successors, (1086), 722 states have internal predecessors, (1086), 0 states have call successors, (0), 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 733 states. [2022-02-20 18:29:47,949 INFO L87 Difference]: Start difference. First operand has 723 states, 722 states have (on average 1.5041551246537397) internal successors, (1086), 722 states have internal predecessors, (1086), 0 states have call successors, (0), 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 733 states. [2022-02-20 18:29:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:47,964 INFO L93 Difference]: Finished difference Result 733 states and 1095 transitions. [2022-02-20 18:29:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1095 transitions. [2022-02-20 18:29:47,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:47,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:47,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:47,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.5041551246537397) internal successors, (1086), 722 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1086 transitions. [2022-02-20 18:29:47,987 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1086 transitions. Word has length 65 [2022-02-20 18:29:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:47,988 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 1086 transitions. [2022-02-20 18:29:47,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1086 transitions. [2022-02-20 18:29:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:29:47,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:47,989 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] [2022-02-20 18:29:47,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:29:47,989 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:47,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1050514983, now seen corresponding path program 1 times [2022-02-20 18:29:47,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:47,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650265782] [2022-02-20 18:29:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:47,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:48,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {13089#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {13089#true} is VALID [2022-02-20 18:29:48,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {13089#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {13089#true} is VALID [2022-02-20 18:29:48,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {13089#true} assume 0 == ~r1~0 % 256; {13089#true} is VALID [2022-02-20 18:29:48,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {13089#true} assume ~id1~0 >= 0; {13089#true} is VALID [2022-02-20 18:29:48,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {13089#true} assume 0 == ~st1~0; {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:29:48,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:29:48,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:29:48,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:29:48,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {13091#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:48,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:48,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:48,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:48,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {13092#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:48,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {13094#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,170 INFO L290 TraceCheckUtils]: 47: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode4~0 % 256); {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode5~0 % 256); {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:48,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {13095#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);check_~tmp~1#1 := 0; {13090#false} is VALID [2022-02-20 18:29:48,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {13090#false} check_#res#1 := check_~tmp~1#1; {13090#false} is VALID [2022-02-20 18:29:48,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {13090#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13090#false} is VALID [2022-02-20 18:29:48,176 INFO L290 TraceCheckUtils]: 63: Hoare triple {13090#false} assume 0 == assert_~arg#1 % 256; {13090#false} is VALID [2022-02-20 18:29:48,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {13090#false} assume !false; {13090#false} is VALID [2022-02-20 18:29:48,177 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:29:48,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:48,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650265782] [2022-02-20 18:29:48,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650265782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:48,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:48,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:29:48,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187076078] [2022-02-20 18:29:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:48,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:48,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:48,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:48,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:48,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:29:48,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:29:48,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:48,227 INFO L87 Difference]: Start difference. First operand 723 states and 1086 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:49,040 INFO L93 Difference]: Finished difference Result 1411 states and 2136 transitions. [2022-02-20 18:29:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:29:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 290 transitions. [2022-02-20 18:29:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 290 transitions. [2022-02-20 18:29:49,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 290 transitions. [2022-02-20 18:29:49,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:49,239 INFO L225 Difference]: With dead ends: 1411 [2022-02-20 18:29:49,239 INFO L226 Difference]: Without dead ends: 725 [2022-02-20 18:29:49,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:29:49,240 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 292 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:49,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 462 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-02-20 18:29:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 723. [2022-02-20 18:29:49,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:49,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 725 states. Second operand has 723 states, 722 states have (on average 1.4930747922437673) internal successors, (1078), 722 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,523 INFO L74 IsIncluded]: Start isIncluded. First operand 725 states. Second operand has 723 states, 722 states have (on average 1.4930747922437673) internal successors, (1078), 722 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,524 INFO L87 Difference]: Start difference. First operand 725 states. Second operand has 723 states, 722 states have (on average 1.4930747922437673) internal successors, (1078), 722 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:49,539 INFO L93 Difference]: Finished difference Result 725 states and 1079 transitions. [2022-02-20 18:29:49,539 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1079 transitions. [2022-02-20 18:29:49,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:49,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:49,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 723 states, 722 states have (on average 1.4930747922437673) internal successors, (1078), 722 states have internal predecessors, (1078), 0 states have call successors, (0), 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 725 states. [2022-02-20 18:29:49,542 INFO L87 Difference]: Start difference. First operand has 723 states, 722 states have (on average 1.4930747922437673) internal successors, (1078), 722 states have internal predecessors, (1078), 0 states have call successors, (0), 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 725 states. [2022-02-20 18:29:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:49,558 INFO L93 Difference]: Finished difference Result 725 states and 1079 transitions. [2022-02-20 18:29:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1079 transitions. [2022-02-20 18:29:49,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:49,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:49,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:49,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.4930747922437673) internal successors, (1078), 722 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1078 transitions. [2022-02-20 18:29:49,577 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1078 transitions. Word has length 65 [2022-02-20 18:29:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:49,577 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 1078 transitions. [2022-02-20 18:29:49,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1078 transitions. [2022-02-20 18:29:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:29:49,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:49,578 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] [2022-02-20 18:29:49,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:29:49,579 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash 738399093, now seen corresponding path program 1 times [2022-02-20 18:29:49,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:49,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557832929] [2022-02-20 18:29:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:49,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {17062#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {17062#true} is VALID [2022-02-20 18:29:49,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {17062#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {17062#true} is VALID [2022-02-20 18:29:49,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {17062#true} assume 0 == ~r1~0 % 256; {17062#true} is VALID [2022-02-20 18:29:49,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {17062#true} assume ~id1~0 >= 0; {17062#true} is VALID [2022-02-20 18:29:49,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {17062#true} assume 0 == ~st1~0; {17062#true} is VALID [2022-02-20 18:29:49,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {17062#true} assume ~send1~0 == ~id1~0; {17062#true} is VALID [2022-02-20 18:29:49,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {17062#true} assume 0 == ~mode1~0 % 256; {17062#true} is VALID [2022-02-20 18:29:49,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {17062#true} assume ~id2~0 >= 0; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {17062#true} assume 0 == ~st2~0; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {17062#true} assume ~send2~0 == ~id2~0; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {17062#true} assume 0 == ~mode2~0 % 256; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {17062#true} assume ~id3~0 >= 0; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {17062#true} assume 0 == ~st3~0; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {17062#true} assume ~send3~0 == ~id3~0; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {17062#true} assume 0 == ~mode3~0 % 256; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {17062#true} assume ~id4~0 >= 0; {17062#true} is VALID [2022-02-20 18:29:49,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {17062#true} assume 0 == ~st4~0; {17062#true} is VALID [2022-02-20 18:29:49,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {17062#true} assume ~send4~0 == ~id4~0; {17062#true} is VALID [2022-02-20 18:29:49,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {17062#true} assume 0 == ~mode4~0 % 256; {17062#true} is VALID [2022-02-20 18:29:49,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {17062#true} assume ~id5~0 >= 0; {17062#true} is VALID [2022-02-20 18:29:49,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {17062#true} assume 0 == ~st5~0; {17062#true} is VALID [2022-02-20 18:29:49,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {17062#true} assume ~send5~0 == ~id5~0; {17062#true} is VALID [2022-02-20 18:29:49,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {17062#true} assume 0 == ~mode5~0 % 256; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {17064#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {17063#false} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {17063#false} assume node5_~m5~0#1 != ~nomsg~0; {17063#false} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {17063#false} assume !(node5_~m5~0#1 > ~id5~0); {17063#false} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {17063#false} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {17063#false} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {17063#false} ~mode5~0 := 0; {17063#false} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {17063#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {17063#false} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {17063#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {17063#false} is VALID [2022-02-20 18:29:49,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {17063#false} check_#res#1 := check_~tmp~1#1; {17063#false} is VALID [2022-02-20 18:29:49,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {17063#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {17063#false} is VALID [2022-02-20 18:29:49,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {17063#false} assume 0 == assert_~arg#1 % 256; {17063#false} is VALID [2022-02-20 18:29:49,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {17063#false} assume !false; {17063#false} is VALID [2022-02-20 18:29:49,669 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:29:49,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:49,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557832929] [2022-02-20 18:29:49,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557832929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:49,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:49,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:49,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288814056] [2022-02-20 18:29:49,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:49,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:49,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:49,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:49,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:49,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:49,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:49,708 INFO L87 Difference]: Start difference. First operand 723 states and 1078 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:50,543 INFO L93 Difference]: Finished difference Result 1999 states and 3000 transitions. [2022-02-20 18:29:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:50,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 282 transitions. [2022-02-20 18:29:50,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:50,755 INFO L225 Difference]: With dead ends: 1999 [2022-02-20 18:29:50,755 INFO L226 Difference]: Without dead ends: 1313 [2022-02-20 18:29:50,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:50,756 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:50,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2022-02-20 18:29:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1311. [2022-02-20 18:29:51,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:51,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1313 states. Second operand has 1311 states, 1310 states have (on average 1.4824427480916031) internal successors, (1942), 1310 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,299 INFO L74 IsIncluded]: Start isIncluded. First operand 1313 states. Second operand has 1311 states, 1310 states have (on average 1.4824427480916031) internal successors, (1942), 1310 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,300 INFO L87 Difference]: Start difference. First operand 1313 states. Second operand has 1311 states, 1310 states have (on average 1.4824427480916031) internal successors, (1942), 1310 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:51,342 INFO L93 Difference]: Finished difference Result 1313 states and 1943 transitions. [2022-02-20 18:29:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1943 transitions. [2022-02-20 18:29:51,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:51,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:51,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 1311 states, 1310 states have (on average 1.4824427480916031) internal successors, (1942), 1310 states have internal predecessors, (1942), 0 states have call successors, (0), 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 1313 states. [2022-02-20 18:29:51,348 INFO L87 Difference]: Start difference. First operand has 1311 states, 1310 states have (on average 1.4824427480916031) internal successors, (1942), 1310 states have internal predecessors, (1942), 0 states have call successors, (0), 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 1313 states. [2022-02-20 18:29:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:51,390 INFO L93 Difference]: Finished difference Result 1313 states and 1943 transitions. [2022-02-20 18:29:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1943 transitions. [2022-02-20 18:29:51,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:51,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:51,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:51,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 1.4824427480916031) internal successors, (1942), 1310 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1942 transitions. [2022-02-20 18:29:51,448 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1942 transitions. Word has length 65 [2022-02-20 18:29:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:51,449 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 1942 transitions. [2022-02-20 18:29:51,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1942 transitions. [2022-02-20 18:29:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:29:51,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:51,450 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] [2022-02-20 18:29:51,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:29:51,450 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1985906709, now seen corresponding path program 1 times [2022-02-20 18:29:51,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:51,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034338457] [2022-02-20 18:29:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {23625#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {23625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {23625#true} assume 0 == ~r1~0 % 256; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {23625#true} assume ~id1~0 >= 0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {23625#true} assume 0 == ~st1~0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {23625#true} assume ~send1~0 == ~id1~0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {23625#true} assume 0 == ~mode1~0 % 256; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {23625#true} assume ~id2~0 >= 0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {23625#true} assume 0 == ~st2~0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {23625#true} assume ~send2~0 == ~id2~0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {23625#true} assume 0 == ~mode2~0 % 256; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {23625#true} assume ~id3~0 >= 0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {23625#true} assume 0 == ~st3~0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {23625#true} assume ~send3~0 == ~id3~0; {23625#true} is VALID [2022-02-20 18:29:51,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {23625#true} assume 0 == ~mode3~0 % 256; {23625#true} is VALID [2022-02-20 18:29:51,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {23625#true} assume ~id4~0 >= 0; {23625#true} is VALID [2022-02-20 18:29:51,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {23625#true} assume 0 == ~st4~0; {23625#true} is VALID [2022-02-20 18:29:51,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {23625#true} assume ~send4~0 == ~id4~0; {23625#true} is VALID [2022-02-20 18:29:51,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {23625#true} assume 0 == ~mode4~0 % 256; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:51,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {23627#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23626#false} is VALID [2022-02-20 18:29:51,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {23626#false} assume node4_~m4~0#1 != ~nomsg~0; {23626#false} is VALID [2022-02-20 18:29:51,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {23626#false} assume !(node4_~m4~0#1 > ~id4~0); {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {23626#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {23626#false} ~mode4~0 := 0; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {23626#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {23626#false} assume !(0 != ~mode5~0 % 256); {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {23626#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {23626#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {23626#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {23626#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {23626#false} check_#res#1 := check_~tmp~1#1; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {23626#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {23626#false} assume 0 == assert_~arg#1 % 256; {23626#false} is VALID [2022-02-20 18:29:51,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {23626#false} assume !false; {23626#false} is VALID [2022-02-20 18:29:51,524 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:29:51,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:51,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034338457] [2022-02-20 18:29:51,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034338457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:51,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:51,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:51,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707390346] [2022-02-20 18:29:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:51,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:51,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:51,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:51,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:51,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:51,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:51,565 INFO L87 Difference]: Start difference. First operand 1311 states and 1942 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:53,119 INFO L93 Difference]: Finished difference Result 3667 states and 5432 transitions. [2022-02-20 18:29:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:53,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:29:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-02-20 18:29:53,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 282 transitions. [2022-02-20 18:29:53,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:53,485 INFO L225 Difference]: With dead ends: 3667 [2022-02-20 18:29:53,486 INFO L226 Difference]: Without dead ends: 2393 [2022-02-20 18:29:53,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:53,488 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 63 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:53,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 263 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-02-20 18:29:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2391. [2022-02-20 18:29:54,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:54,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2393 states. Second operand has 2391 states, 2390 states have (on average 1.4619246861924686) internal successors, (3494), 2390 states have internal predecessors, (3494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:54,650 INFO L74 IsIncluded]: Start isIncluded. First operand 2393 states. Second operand has 2391 states, 2390 states have (on average 1.4619246861924686) internal successors, (3494), 2390 states have internal predecessors, (3494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:54,651 INFO L87 Difference]: Start difference. First operand 2393 states. Second operand has 2391 states, 2390 states have (on average 1.4619246861924686) internal successors, (3494), 2390 states have internal predecessors, (3494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:54,787 INFO L93 Difference]: Finished difference Result 2393 states and 3495 transitions. [2022-02-20 18:29:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3495 transitions. [2022-02-20 18:29:54,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:54,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:54,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 2391 states, 2390 states have (on average 1.4619246861924686) internal successors, (3494), 2390 states have internal predecessors, (3494), 0 states have call successors, (0), 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 2393 states. [2022-02-20 18:29:54,795 INFO L87 Difference]: Start difference. First operand has 2391 states, 2390 states have (on average 1.4619246861924686) internal successors, (3494), 2390 states have internal predecessors, (3494), 0 states have call successors, (0), 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 2393 states. [2022-02-20 18:29:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:54,934 INFO L93 Difference]: Finished difference Result 2393 states and 3495 transitions. [2022-02-20 18:29:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3495 transitions. [2022-02-20 18:29:54,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:54,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:54,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:54,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2390 states have (on average 1.4619246861924686) internal successors, (3494), 2390 states have internal predecessors, (3494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3494 transitions. [2022-02-20 18:29:55,110 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3494 transitions. Word has length 65 [2022-02-20 18:29:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:55,110 INFO L470 AbstractCegarLoop]: Abstraction has 2391 states and 3494 transitions. [2022-02-20 18:29:55,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3494 transitions. [2022-02-20 18:29:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:29:55,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:55,111 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] [2022-02-20 18:29:55,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:29:55,111 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1379050855, now seen corresponding path program 1 times [2022-02-20 18:29:55,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:55,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524438411] [2022-02-20 18:29:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:55,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {35716#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {35716#true} is VALID [2022-02-20 18:29:55,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {35716#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {35716#true} assume 0 == ~r1~0 % 256; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {35716#true} assume ~id1~0 >= 0; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {35716#true} assume 0 == ~st1~0; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {35716#true} assume ~send1~0 == ~id1~0; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {35716#true} assume 0 == ~mode1~0 % 256; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {35716#true} assume ~id2~0 >= 0; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {35716#true} assume 0 == ~st2~0; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {35716#true} assume ~send2~0 == ~id2~0; {35716#true} is VALID [2022-02-20 18:29:55,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {35716#true} assume 0 == ~mode2~0 % 256; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {35716#true} assume ~id3~0 >= 0; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {35716#true} assume 0 == ~st3~0; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {35716#true} assume ~send3~0 == ~id3~0; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {35716#true} assume 0 == ~mode3~0 % 256; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {35716#true} assume ~id4~0 >= 0; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {35716#true} assume 0 == ~st4~0; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {35716#true} assume ~send4~0 == ~id4~0; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {35716#true} assume 0 == ~mode4~0 % 256; {35716#true} is VALID [2022-02-20 18:29:55,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {35716#true} assume ~id5~0 >= 0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {35716#true} assume 0 == ~st5~0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {35716#true} assume ~send5~0 == ~id5~0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {35716#true} assume 0 == ~mode5~0 % 256; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {35716#true} assume ~id1~0 != ~id2~0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {35716#true} assume ~id1~0 != ~id3~0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {35716#true} assume ~id1~0 != ~id4~0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {35716#true} assume ~id1~0 != ~id5~0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {35716#true} assume ~id2~0 != ~id3~0; {35716#true} is VALID [2022-02-20 18:29:55,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {35716#true} assume ~id2~0 != ~id4~0; {35716#true} is VALID [2022-02-20 18:29:55,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {35716#true} assume ~id2~0 != ~id5~0; {35716#true} is VALID [2022-02-20 18:29:55,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {35716#true} assume ~id3~0 != ~id4~0; {35716#true} is VALID [2022-02-20 18:29:55,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {35716#true} assume ~id3~0 != ~id5~0; {35716#true} is VALID [2022-02-20 18:29:55,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {35716#true} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {35718#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:29:55,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {35718#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {35719#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {35719#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {35720#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {35720#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {35716#true} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {35716#true} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {35716#true} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {35716#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {35716#true} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {35716#true} assume !(0 != ~mode1~0 % 256); {35716#true} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {35716#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {35716#true} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {35716#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {35716#true} is VALID [2022-02-20 18:29:55,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {35716#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {35716#true} assume !(0 != ~mode2~0 % 256); {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {35716#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {35716#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {35716#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {35716#true} assume !(0 != ~mode3~0 % 256); {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {35716#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {35716#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {35716#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {35716#true} is VALID [2022-02-20 18:29:55,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {35716#true} assume !(0 != ~mode4~0 % 256); {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {35716#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {35716#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {35716#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {35716#true} assume !(0 != ~mode5~0 % 256); {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {35716#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {35716#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {35716#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {35716#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {35716#true} is VALID [2022-02-20 18:29:55,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {35716#true} assume !(~r1~0 % 256 >= 5); {35716#true} is VALID [2022-02-20 18:29:55,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {35716#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {35716#true} is VALID [2022-02-20 18:29:55,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {35716#true} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {35721#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:29:55,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {35721#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {35722#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:29:55,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {35722#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {35723#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:29:55,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {35723#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {35717#false} is VALID [2022-02-20 18:29:55,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {35717#false} assume !false; {35717#false} is VALID [2022-02-20 18:29:55,195 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:29:55,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:55,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524438411] [2022-02-20 18:29:55,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524438411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:55,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:55,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:29:55,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305134201] [2022-02-20 18:29:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:55,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:29:55,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:55,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:55,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:55,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:29:55,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:55,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:29:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:55,229 INFO L87 Difference]: Start difference. First operand 2391 states and 3494 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:58,606 INFO L93 Difference]: Finished difference Result 4149 states and 6028 transitions. [2022-02-20 18:29:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:29:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:29:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2022-02-20 18:29:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2022-02-20 18:29:58,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 211 transitions. [2022-02-20 18:29:58,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:59,371 INFO L225 Difference]: With dead ends: 4149 [2022-02-20 18:29:59,371 INFO L226 Difference]: Without dead ends: 4147 [2022-02-20 18:29:59,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:29:59,372 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 600 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:59,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 619 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4147 states. [2022-02-20 18:30:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 2487. [2022-02-20 18:30:00,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:00,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4147 states. Second operand has 2487 states, 2486 states have (on average 1.4376508447304908) internal successors, (3574), 2486 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,902 INFO L74 IsIncluded]: Start isIncluded. First operand 4147 states. Second operand has 2487 states, 2486 states have (on average 1.4376508447304908) internal successors, (3574), 2486 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,905 INFO L87 Difference]: Start difference. First operand 4147 states. Second operand has 2487 states, 2486 states have (on average 1.4376508447304908) internal successors, (3574), 2486 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:01,337 INFO L93 Difference]: Finished difference Result 4147 states and 5979 transitions. [2022-02-20 18:30:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5979 transitions. [2022-02-20 18:30:01,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:01,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:01,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 2487 states, 2486 states have (on average 1.4376508447304908) internal successors, (3574), 2486 states have internal predecessors, (3574), 0 states have call successors, (0), 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 4147 states. [2022-02-20 18:30:01,345 INFO L87 Difference]: Start difference. First operand has 2487 states, 2486 states have (on average 1.4376508447304908) internal successors, (3574), 2486 states have internal predecessors, (3574), 0 states have call successors, (0), 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 4147 states. [2022-02-20 18:30:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:01,783 INFO L93 Difference]: Finished difference Result 4147 states and 5979 transitions. [2022-02-20 18:30:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5979 transitions. [2022-02-20 18:30:01,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:01,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:01,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:01,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.4376508447304908) internal successors, (3574), 2486 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3574 transitions. [2022-02-20 18:30:01,982 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3574 transitions. Word has length 66 [2022-02-20 18:30:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:01,982 INFO L470 AbstractCegarLoop]: Abstraction has 2487 states and 3574 transitions. [2022-02-20 18:30:01,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3574 transitions. [2022-02-20 18:30:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:30:01,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:01,983 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] [2022-02-20 18:30:01,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:30:01,983 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1091422096, now seen corresponding path program 1 times [2022-02-20 18:30:01,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:01,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430115105] [2022-02-20 18:30:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:02,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {52121#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {52121#true} is VALID [2022-02-20 18:30:02,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {52121#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {52121#true} is VALID [2022-02-20 18:30:02,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {52121#true} assume 0 == ~r1~0 % 256; {52121#true} is VALID [2022-02-20 18:30:02,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {52121#true} assume ~id1~0 >= 0; {52121#true} is VALID [2022-02-20 18:30:02,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {52121#true} assume 0 == ~st1~0; {52121#true} is VALID [2022-02-20 18:30:02,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {52121#true} assume ~send1~0 == ~id1~0; {52121#true} is VALID [2022-02-20 18:30:02,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {52121#true} assume 0 == ~mode1~0 % 256; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {52123#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {52122#false} assume !(255 == ~r1~0 % 256); {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {52122#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {52122#false} assume node1_~m1~0#1 != ~nomsg~0; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {52122#false} assume !(node1_~m1~0#1 > ~id1~0); {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {52122#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {52122#false} ~mode1~0 := 0; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {52122#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {52122#false} assume !(0 != ~mode2~0 % 256); {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {52122#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {52122#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {52122#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {52122#false} is VALID [2022-02-20 18:30:02,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {52122#false} assume !(0 != ~mode3~0 % 256); {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {52122#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {52122#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {52122#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {52122#false} assume !(0 != ~mode4~0 % 256); {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {52122#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {52122#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {52122#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {52122#false} assume !(0 != ~mode5~0 % 256); {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {52122#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {52122#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {52122#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {52122#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {52122#false} is VALID [2022-02-20 18:30:02,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {52122#false} check_#res#1 := check_~tmp~1#1; {52122#false} is VALID [2022-02-20 18:30:02,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {52122#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {52122#false} is VALID [2022-02-20 18:30:02,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {52122#false} assume 0 == assert_~arg#1 % 256; {52122#false} is VALID [2022-02-20 18:30:02,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {52122#false} assume !false; {52122#false} is VALID [2022-02-20 18:30:02,056 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:30:02,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:02,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430115105] [2022-02-20 18:30:02,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430115105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:02,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:02,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:02,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643307746] [2022-02-20 18:30:02,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:02,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:30:02,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:02,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:02,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:02,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:02,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:02,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:02,094 INFO L87 Difference]: Start difference. First operand 2487 states and 3574 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:05,306 INFO L93 Difference]: Finished difference Result 4990 states and 7228 transitions. [2022-02-20 18:30:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:30:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2022-02-20 18:30:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2022-02-20 18:30:05,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 279 transitions. [2022-02-20 18:30:05,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:05,975 INFO L225 Difference]: With dead ends: 4990 [2022-02-20 18:30:05,975 INFO L226 Difference]: Without dead ends: 3611 [2022-02-20 18:30:05,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:05,977 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 72 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:05,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 269 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2022-02-20 18:30:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3609. [2022-02-20 18:30:08,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:08,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3611 states. Second operand has 3609 states, 3608 states have (on average 1.4301552106430155) internal successors, (5160), 3608 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,250 INFO L74 IsIncluded]: Start isIncluded. First operand 3611 states. Second operand has 3609 states, 3608 states have (on average 1.4301552106430155) internal successors, (5160), 3608 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,252 INFO L87 Difference]: Start difference. First operand 3611 states. Second operand has 3609 states, 3608 states have (on average 1.4301552106430155) internal successors, (5160), 3608 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:08,593 INFO L93 Difference]: Finished difference Result 3611 states and 5161 transitions. [2022-02-20 18:30:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 5161 transitions. [2022-02-20 18:30:08,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:08,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:08,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 3609 states, 3608 states have (on average 1.4301552106430155) internal successors, (5160), 3608 states have internal predecessors, (5160), 0 states have call successors, (0), 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 3611 states. [2022-02-20 18:30:08,600 INFO L87 Difference]: Start difference. First operand has 3609 states, 3608 states have (on average 1.4301552106430155) internal successors, (5160), 3608 states have internal predecessors, (5160), 0 states have call successors, (0), 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 3611 states. [2022-02-20 18:30:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:08,945 INFO L93 Difference]: Finished difference Result 3611 states and 5161 transitions. [2022-02-20 18:30:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 5161 transitions. [2022-02-20 18:30:08,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:08,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:08,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:08,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 3608 states have (on average 1.4301552106430155) internal successors, (5160), 3608 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 5160 transitions. [2022-02-20 18:30:09,358 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 5160 transitions. Word has length 67 [2022-02-20 18:30:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:09,359 INFO L470 AbstractCegarLoop]: Abstraction has 3609 states and 5160 transitions. [2022-02-20 18:30:09,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 5160 transitions. [2022-02-20 18:30:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:30:09,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:09,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:09,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:30:09,360 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash 291374621, now seen corresponding path program 1 times [2022-02-20 18:30:09,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:09,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201094237] [2022-02-20 18:30:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:09,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {69871#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; {69871#true} is VALID [2022-02-20 18:30:09,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {69871#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {69871#true} is VALID [2022-02-20 18:30:09,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {69871#true} assume 0 == ~r1~0 % 256; {69871#true} is VALID [2022-02-20 18:30:09,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {69871#true} assume ~id1~0 >= 0; {69871#true} is VALID [2022-02-20 18:30:09,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {69871#true} assume 0 == ~st1~0; {69873#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:09,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {69873#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {69873#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:09,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {69873#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {69873#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:09,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {69873#(<= ~st1~0 0)} assume ~id2~0 >= 0; {69873#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:09,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {69873#(<= ~st1~0 0)} assume 0 == ~st2~0; {69874#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {69874#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {69874#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {69874#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {69874#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {69874#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {69874#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {69874#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {69875#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,465 INFO L290 TraceCheckUtils]: 64: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,477 INFO L290 TraceCheckUtils]: 66: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,477 INFO L290 TraceCheckUtils]: 68: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,479 INFO L290 TraceCheckUtils]: 72: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,479 INFO L290 TraceCheckUtils]: 73: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,480 INFO L290 TraceCheckUtils]: 76: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 != ~nomsg~0); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,480 INFO L290 TraceCheckUtils]: 77: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,480 INFO L290 TraceCheckUtils]: 78: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,481 INFO L290 TraceCheckUtils]: 79: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,481 INFO L290 TraceCheckUtils]: 82: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,482 INFO L290 TraceCheckUtils]: 83: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume node5_~m5~0#1 != ~nomsg~0; {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,482 INFO L290 TraceCheckUtils]: 85: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node5_~m5~0#1 > ~id5~0); {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:09,483 INFO L290 TraceCheckUtils]: 86: Hoare triple {69876#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {69877#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:09,483 INFO L290 TraceCheckUtils]: 87: Hoare triple {69877#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~mode5~0 := 0; {69877#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:09,483 INFO L290 TraceCheckUtils]: 88: Hoare triple {69877#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {69877#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:09,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {69877#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {69872#false} is VALID [2022-02-20 18:30:09,484 INFO L290 TraceCheckUtils]: 90: Hoare triple {69872#false} check_#res#1 := check_~tmp~1#1; {69872#false} is VALID [2022-02-20 18:30:09,484 INFO L290 TraceCheckUtils]: 91: Hoare triple {69872#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {69872#false} is VALID [2022-02-20 18:30:09,484 INFO L290 TraceCheckUtils]: 92: Hoare triple {69872#false} assume 0 == assert_~arg#1 % 256; {69872#false} is VALID [2022-02-20 18:30:09,484 INFO L290 TraceCheckUtils]: 93: Hoare triple {69872#false} assume !false; {69872#false} is VALID [2022-02-20 18:30:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 18:30:09,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:09,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201094237] [2022-02-20 18:30:09,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201094237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:09,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:09,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:30:09,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032531909] [2022-02-20 18:30:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 94 [2022-02-20 18:30:09,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:09,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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:30:09,534 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:30:09,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:30:09,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:30:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:09,535 INFO L87 Difference]: Start difference. First operand 3609 states and 5160 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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:30:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:41,036 INFO L93 Difference]: Finished difference Result 22181 states and 31758 transitions. [2022-02-20 18:30:41,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:30:41,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 94 [2022-02-20 18:30:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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:30:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-02-20 18:30:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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:30:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-02-20 18:30:41,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 629 transitions. [2022-02-20 18:30:41,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.