./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.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.BOUNDED-10.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 2c3b1a53bc376cbb6283db57f6430d0a17b3acc99aa70ab198c7c36e6e59ecc9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:29:38,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:29:38,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:29:38,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:29:38,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:29:38,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:29:38,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:29:38,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:29:38,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:29:38,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:29:38,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:29:38,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:29:38,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:29:38,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:29:38,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:29:38,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:29:38,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:29:38,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:29:38,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:29:38,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:29:38,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:29:38,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:29:38,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:29:38,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:29:38,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:29:38,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:29:38,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:29:38,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:29:38,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:29:38,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:29:38,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:29:38,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:29:38,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:29:38,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:29:38,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:29:38,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:29:38,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:29:38,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:29:38,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:29:38,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:29:38,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:29:38,432 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:38,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:29:38,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:29:38,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:29:38,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:29:38,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:29:38,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:29:38,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:29:38,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:29:38,464 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:29:38,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:29:38,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:29:38,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:29:38,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:29:38,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:29:38,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:29:38,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:29:38,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:29:38,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:29:38,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:29:38,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:29:38,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:29:38,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:29:38,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:29:38,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:29:38,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:38,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:29:38,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:29:38,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:29:38,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:29:38,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:29:38,469 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:29:38,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:29:38,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:29:38,469 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 -> 2c3b1a53bc376cbb6283db57f6430d0a17b3acc99aa70ab198c7c36e6e59ecc9 [2022-02-20 18:29:38,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:29:38,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:29:38,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:29:38,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:29:38,734 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:29:38,735 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.BOUNDED-10.pals.c [2022-02-20 18:29:38,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8ae3ef4/d1a6789bf04e4412b75fbede7b32fe8d/FLAGb28425088 [2022-02-20 18:29:39,238 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:29:39,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2022-02-20 18:29:39,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8ae3ef4/d1a6789bf04e4412b75fbede7b32fe8d/FLAGb28425088 [2022-02-20 18:29:39,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8ae3ef4/d1a6789bf04e4412b75fbede7b32fe8d [2022-02-20 18:29:39,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:29:39,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:29:39,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:39,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:29:39,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:29:39,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:39" (1/1) ... [2022-02-20 18:29:39,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129ef3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:39, skipping insertion in model container [2022-02-20 18:29:39,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:39" (1/1) ... [2022-02-20 18:29:39,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:29:39,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:29:40,065 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.BOUNDED-10.pals.c[11270,11283] [2022-02-20 18:29:40,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:40,078 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:29:40,109 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.BOUNDED-10.pals.c[11270,11283] [2022-02-20 18:29:40,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:40,120 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:29:40,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:40 WrapperNode [2022-02-20 18:29:40,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:40,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:40,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:29:40,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:29:40,126 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:40" (1/1) ... [2022-02-20 18:29:40,133 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:40" (1/1) ... [2022-02-20 18:29:40,156 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 334 [2022-02-20 18:29:40,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:40,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:29:40,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:29:40,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:29:40,163 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:40" (1/1) ... [2022-02-20 18:29:40,163 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:40" (1/1) ... [2022-02-20 18:29:40,166 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:40" (1/1) ... [2022-02-20 18:29:40,166 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:40" (1/1) ... [2022-02-20 18:29:40,171 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:40" (1/1) ... [2022-02-20 18:29:40,175 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:40" (1/1) ... [2022-02-20 18:29:40,177 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:40" (1/1) ... [2022-02-20 18:29:40,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:29:40,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:29:40,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:29:40,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:29:40,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:40" (1/1) ... [2022-02-20 18:29:40,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:40,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:40,229 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:40,240 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:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:29:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:29:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:29:40,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:29:40,361 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:29:40,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:29:40,833 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:29:40,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:29:40,838 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:29:40,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:40 BoogieIcfgContainer [2022-02-20 18:29:40,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:29:40,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:29:40,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:29:40,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:29:40,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:29:39" (1/3) ... [2022-02-20 18:29:40,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7032361c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:40, skipping insertion in model container [2022-02-20 18:29:40,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:40" (2/3) ... [2022-02-20 18:29:40,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7032361c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:40, skipping insertion in model container [2022-02-20 18:29:40,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:40" (3/3) ... [2022-02-20 18:29:40,845 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2022-02-20 18:29:40,848 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:29:40,848 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:29:40,874 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:29:40,879 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:40,879 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:29:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 92 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call 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:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:29:40,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:40,894 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:40,895 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash 8392247, now seen corresponding path program 1 times [2022-02-20 18:29:40,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:40,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109716326] [2022-02-20 18:29:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:41,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#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(35, 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; {96#true} is VALID [2022-02-20 18:29:41,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {96#true} is VALID [2022-02-20 18:29:41,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {96#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {96#true} is VALID [2022-02-20 18:29:41,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {96#true} init_#res#1 := init_~tmp~0#1; {96#true} is VALID [2022-02-20 18:29:41,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {96#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; {96#true} is VALID [2022-02-20 18:29:41,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {97#false} is VALID [2022-02-20 18:29:41,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {97#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; {97#false} is VALID [2022-02-20 18:29:41,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {97#false} assume !!(main_~i2~0#1 < 10);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; {97#false} is VALID [2022-02-20 18:29:41,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {97#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:41,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {97#false} assume !(node1_~m1~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:41,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {97#false} ~mode1~0 := 0; {97#false} is VALID [2022-02-20 18:29:41,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {97#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; {97#false} is VALID [2022-02-20 18:29:41,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {97#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:41,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {97#false} assume !(node2_~m2~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:41,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {97#false} ~mode2~0 := 0; {97#false} is VALID [2022-02-20 18:29:41,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {97#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; {97#false} is VALID [2022-02-20 18:29:41,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {97#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:41,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {97#false} assume !(node3_~m3~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:41,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {97#false} ~mode3~0 := 0; {97#false} is VALID [2022-02-20 18:29:41,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {97#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; {97#false} is VALID [2022-02-20 18:29:41,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {97#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:41,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {97#false} assume !(node4_~m4~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:41,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {97#false} ~mode4~0 := 0; {97#false} is VALID [2022-02-20 18:29:41,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {97#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; {97#false} is VALID [2022-02-20 18:29:41,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {97#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:41,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {97#false} assume !(node5_~m5~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:41,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {97#false} ~mode5~0 := 0; {97#false} is VALID [2022-02-20 18:29:41,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {97#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; {97#false} is VALID [2022-02-20 18:29:41,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {97#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {97#false} is VALID [2022-02-20 18:29:41,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {97#false} check_#res#1 := check_~tmp~1#1; {97#false} is VALID [2022-02-20 18:29:41,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {97#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; {97#false} is VALID [2022-02-20 18:29:41,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {97#false} assume 0 == assert_~arg#1 % 256; {97#false} is VALID [2022-02-20 18:29:41,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {97#false} assume !false; {97#false} is VALID [2022-02-20 18:29:41,061 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:41,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:41,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109716326] [2022-02-20 18:29:41,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109716326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:41,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:41,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:29:41,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350825998] [2022-02-20 18:29:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:41,069 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:41,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:41,073 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:41,104 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:41,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:29:41,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:29:41,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:41,127 INFO L87 Difference]: Start difference. First operand has 93 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 92 states have internal predecessors, (157), 0 states have call successors, (0), 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:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,229 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2022-02-20 18:29:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:29:41,230 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:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:41,230 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:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 246 transitions. [2022-02-20 18:29:41,239 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:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 246 transitions. [2022-02-20 18:29:41,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 246 transitions. [2022-02-20 18:29:41,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:41,470 INFO L225 Difference]: With dead ends: 150 [2022-02-20 18:29:41,471 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 18:29:41,473 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:41,475 INFO L933 BasicCegarLoop]: 154 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, 154 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:41,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 154 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:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 18:29:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 18:29:41,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:41,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call 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,502 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call 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,502 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call 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,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,507 INFO L93 Difference]: Finished difference Result 89 states and 150 transitions. [2022-02-20 18:29:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2022-02-20 18:29:41,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:41,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:41,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:41,509 INFO L87 Difference]: Start difference. First operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,513 INFO L93 Difference]: Finished difference Result 89 states and 150 transitions. [2022-02-20 18:29:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2022-02-20 18:29:41,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:41,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:41,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:41,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call 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,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 150 transitions. [2022-02-20 18:29:41,518 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 150 transitions. Word has length 33 [2022-02-20 18:29:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:41,519 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 150 transitions. [2022-02-20 18:29:41,519 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:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2022-02-20 18:29:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:29:41,520 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:41,520 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,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:29:41,521 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -501080843, now seen corresponding path program 1 times [2022-02-20 18:29:41,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:41,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749590700] [2022-02-20 18:29:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:41,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#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(35, 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; {545#true} is VALID [2022-02-20 18:29:41,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {545#true} is VALID [2022-02-20 18:29:41,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {547#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:29:41,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {547#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {548#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:29:41,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {548#(= |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; {549#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:29:41,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {546#false} is VALID [2022-02-20 18:29:41,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {546#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; {546#false} is VALID [2022-02-20 18:29:41,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {546#false} assume !!(main_~i2~0#1 < 10);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; {546#false} is VALID [2022-02-20 18:29:41,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {546#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {546#false} is VALID [2022-02-20 18:29:41,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#false} assume !(node1_~m1~0#1 != ~nomsg~0); {546#false} is VALID [2022-02-20 18:29:41,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#false} ~mode1~0 := 0; {546#false} is VALID [2022-02-20 18:29:41,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#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; {546#false} is VALID [2022-02-20 18:29:41,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {546#false} is VALID [2022-02-20 18:29:41,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume !(node2_~m2~0#1 != ~nomsg~0); {546#false} is VALID [2022-02-20 18:29:41,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {546#false} ~mode2~0 := 0; {546#false} is VALID [2022-02-20 18:29:41,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {546#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; {546#false} is VALID [2022-02-20 18:29:41,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {546#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {546#false} is VALID [2022-02-20 18:29:41,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {546#false} assume !(node3_~m3~0#1 != ~nomsg~0); {546#false} is VALID [2022-02-20 18:29:41,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {546#false} ~mode3~0 := 0; {546#false} is VALID [2022-02-20 18:29:41,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {546#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; {546#false} is VALID [2022-02-20 18:29:41,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {546#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {546#false} is VALID [2022-02-20 18:29:41,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {546#false} assume !(node4_~m4~0#1 != ~nomsg~0); {546#false} is VALID [2022-02-20 18:29:41,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {546#false} ~mode4~0 := 0; {546#false} is VALID [2022-02-20 18:29:41,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {546#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; {546#false} is VALID [2022-02-20 18:29:41,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {546#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {546#false} is VALID [2022-02-20 18:29:41,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {546#false} assume !(node5_~m5~0#1 != ~nomsg~0); {546#false} is VALID [2022-02-20 18:29:41,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {546#false} ~mode5~0 := 0; {546#false} is VALID [2022-02-20 18:29:41,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {546#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; {546#false} is VALID [2022-02-20 18:29:41,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {546#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {546#false} is VALID [2022-02-20 18:29:41,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {546#false} check_#res#1 := check_~tmp~1#1; {546#false} is VALID [2022-02-20 18:29:41,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {546#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; {546#false} is VALID [2022-02-20 18:29:41,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {546#false} assume 0 == assert_~arg#1 % 256; {546#false} is VALID [2022-02-20 18:29:41,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-02-20 18:29:41,664 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:41,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:41,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749590700] [2022-02-20 18:29:41,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749590700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:41,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:41,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:41,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800526169] [2022-02-20 18:29:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:41,667 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:41,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:41,668 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:41,687 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:41,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:41,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:41,690 INFO L87 Difference]: Start difference. First operand 89 states and 150 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:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:41,941 INFO L93 Difference]: Finished difference Result 145 states and 236 transitions. [2022-02-20 18:29:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:41,942 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:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:41,942 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:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2022-02-20 18:29:41,944 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:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2022-02-20 18:29:41,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 236 transitions. [2022-02-20 18:29:42,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:42,109 INFO L225 Difference]: With dead ends: 145 [2022-02-20 18:29:42,110 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 18:29:42,110 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:42,111 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 558 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:42,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 558 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:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 18:29:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 18:29:42,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:42,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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,116 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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,116 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,118 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2022-02-20 18:29:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-02-20 18:29:42,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:42,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:42,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:42,119 INFO L87 Difference]: Start difference. First operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,121 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2022-02-20 18:29:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-02-20 18:29:42,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:42,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:42,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:42,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2022-02-20 18:29:42,124 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 33 [2022-02-20 18:29:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:42,125 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2022-02-20 18:29:42,125 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:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-02-20 18:29:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:42,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:42,126 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:42,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:29:42,126 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash 988628396, now seen corresponding path program 1 times [2022-02-20 18:29:42,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:42,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520258655] [2022-02-20 18:29:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:42,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {995#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(35, 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; {995#true} is VALID [2022-02-20 18:29:42,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {995#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {995#true} is VALID [2022-02-20 18:29:42,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {995#true} assume 0 == ~r1~0; {995#true} is VALID [2022-02-20 18:29:42,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {995#true} assume ~id1~0 >= 0; {995#true} is VALID [2022-02-20 18:29:42,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {995#true} assume 0 == ~st1~0; {995#true} is VALID [2022-02-20 18:29:42,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {995#true} assume ~send1~0 == ~id1~0; {995#true} is VALID [2022-02-20 18:29:42,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {995#true} assume 0 == ~mode1~0 % 256; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {997#(= (+ (* (- 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; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {997#(= (+ (* (- 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; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 10);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; {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:42,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {997#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:29:42,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {996#false} assume !(node1_~m1~0#1 != ~nomsg~0); {996#false} is VALID [2022-02-20 18:29:42,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {996#false} ~mode1~0 := 0; {996#false} is VALID [2022-02-20 18:29:42,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {996#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; {996#false} is VALID [2022-02-20 18:29:42,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {996#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:29:42,229 INFO L290 TraceCheckUtils]: 43: Hoare triple {996#false} assume !(node2_~m2~0#1 != ~nomsg~0); {996#false} is VALID [2022-02-20 18:29:42,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {996#false} ~mode2~0 := 0; {996#false} is VALID [2022-02-20 18:29:42,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {996#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; {996#false} is VALID [2022-02-20 18:29:42,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {996#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:29:42,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {996#false} assume !(node3_~m3~0#1 != ~nomsg~0); {996#false} is VALID [2022-02-20 18:29:42,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {996#false} ~mode3~0 := 0; {996#false} is VALID [2022-02-20 18:29:42,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {996#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; {996#false} is VALID [2022-02-20 18:29:42,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {996#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:29:42,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {996#false} assume !(node4_~m4~0#1 != ~nomsg~0); {996#false} is VALID [2022-02-20 18:29:42,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {996#false} ~mode4~0 := 0; {996#false} is VALID [2022-02-20 18:29:42,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {996#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; {996#false} is VALID [2022-02-20 18:29:42,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {996#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:29:42,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {996#false} assume !(node5_~m5~0#1 != ~nomsg~0); {996#false} is VALID [2022-02-20 18:29:42,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {996#false} ~mode5~0 := 0; {996#false} is VALID [2022-02-20 18:29:42,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {996#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; {996#false} is VALID [2022-02-20 18:29:42,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {996#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {996#false} is VALID [2022-02-20 18:29:42,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {996#false} check_#res#1 := check_~tmp~1#1; {996#false} is VALID [2022-02-20 18:29:42,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {996#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; {996#false} is VALID [2022-02-20 18:29:42,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {996#false} assume 0 == assert_~arg#1 % 256; {996#false} is VALID [2022-02-20 18:29:42,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {996#false} assume !false; {996#false} is VALID [2022-02-20 18:29:42,233 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,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:42,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520258655] [2022-02-20 18:29:42,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520258655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:42,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:42,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:42,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948600544] [2022-02-20 18:29:42,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:42,234 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:42,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:42,235 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:42,274 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:42,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:42,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:42,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:42,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:42,275 INFO L87 Difference]: Start difference. First operand 89 states and 119 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:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,407 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2022-02-20 18:29:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:42,407 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:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:42,408 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:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:42,409 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:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:42,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:29:42,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:42,587 INFO L225 Difference]: With dead ends: 187 [2022-02-20 18:29:42,587 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 18:29:42,587 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:42,588 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 72 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 267 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:42,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 267 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:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 18:29:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-02-20 18:29:42,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:42,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call 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,594 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call 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,595 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call 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,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,597 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2022-02-20 18:29:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2022-02-20 18:29:42,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:42,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:42,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 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 135 states. [2022-02-20 18:29:42,599 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 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 135 states. [2022-02-20 18:29:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,601 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2022-02-20 18:29:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2022-02-20 18:29:42,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:42,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:42,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:42,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call 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,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 189 transitions. [2022-02-20 18:29:42,605 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 189 transitions. Word has length 63 [2022-02-20 18:29:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:42,606 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 189 transitions. [2022-02-20 18:29:42,606 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:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 189 transitions. [2022-02-20 18:29:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:42,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:42,606 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:42,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:29:42,607 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 243045666, now seen corresponding path program 1 times [2022-02-20 18:29:42,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:42,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302674140] [2022-02-20 18:29:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:42,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1632#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(35, 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; {1632#true} is VALID [2022-02-20 18:29:42,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1632#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {1632#true} is VALID [2022-02-20 18:29:42,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {1632#true} assume 0 == ~r1~0; {1632#true} is VALID [2022-02-20 18:29:42,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {1632#true} assume ~id1~0 >= 0; {1632#true} is VALID [2022-02-20 18:29:42,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {1632#true} assume 0 == ~st1~0; {1632#true} is VALID [2022-02-20 18:29:42,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1632#true} assume ~send1~0 == ~id1~0; {1632#true} is VALID [2022-02-20 18:29:42,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {1632#true} assume 0 == ~mode1~0 % 256; {1632#true} is VALID [2022-02-20 18:29:42,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {1632#true} assume ~id2~0 >= 0; {1632#true} is VALID [2022-02-20 18:29:42,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {1632#true} assume 0 == ~st2~0; {1632#true} is VALID [2022-02-20 18:29:42,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {1632#true} assume ~send2~0 == ~id2~0; {1632#true} is VALID [2022-02-20 18:29:42,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {1632#true} assume 0 == ~mode2~0 % 256; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {1634#(= (+ (* (- 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; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {1634#(= (+ (* (- 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; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 10);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; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {1634#(= (+ (* (- 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; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {1634#(= (+ (* (- 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; {1634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:42,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {1634#(= (+ (* (- 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; {1633#false} is VALID [2022-02-20 18:29:42,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {1633#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1633#false} is VALID [2022-02-20 18:29:42,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {1633#false} ~mode2~0 := 0; {1633#false} is VALID [2022-02-20 18:29:42,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {1633#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; {1633#false} is VALID [2022-02-20 18:29:42,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {1633#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1633#false} is VALID [2022-02-20 18:29:42,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {1633#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1633#false} is VALID [2022-02-20 18:29:42,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {1633#false} ~mode3~0 := 0; {1633#false} is VALID [2022-02-20 18:29:42,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {1633#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; {1633#false} is VALID [2022-02-20 18:29:42,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {1633#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1633#false} is VALID [2022-02-20 18:29:42,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {1633#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1633#false} is VALID [2022-02-20 18:29:42,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {1633#false} ~mode4~0 := 0; {1633#false} is VALID [2022-02-20 18:29:42,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {1633#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; {1633#false} is VALID [2022-02-20 18:29:42,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {1633#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1633#false} is VALID [2022-02-20 18:29:42,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {1633#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1633#false} is VALID [2022-02-20 18:29:42,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {1633#false} ~mode5~0 := 0; {1633#false} is VALID [2022-02-20 18:29:42,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {1633#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; {1633#false} is VALID [2022-02-20 18:29:42,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {1633#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {1633#false} is VALID [2022-02-20 18:29:42,681 INFO L290 TraceCheckUtils]: 59: Hoare triple {1633#false} check_#res#1 := check_~tmp~1#1; {1633#false} is VALID [2022-02-20 18:29:42,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {1633#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; {1633#false} is VALID [2022-02-20 18:29:42,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {1633#false} assume 0 == assert_~arg#1 % 256; {1633#false} is VALID [2022-02-20 18:29:42,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {1633#false} assume !false; {1633#false} is VALID [2022-02-20 18:29:42,682 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,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:42,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302674140] [2022-02-20 18:29:42,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302674140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:42,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:42,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:42,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853741108] [2022-02-20 18:29:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:42,683 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:42,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:42,684 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:42,725 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:42,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 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,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:42,726 INFO L87 Difference]: Start difference. First operand 133 states and 189 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:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:42,862 INFO L93 Difference]: Finished difference Result 313 states and 473 transitions. [2022-02-20 18:29:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:42,863 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:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:42,863 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:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:42,865 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:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:42,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:29:43,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:43,040 INFO L225 Difference]: With dead ends: 313 [2022-02-20 18:29:43,040 INFO L226 Difference]: Without dead ends: 217 [2022-02-20 18:29:43,040 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,041 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 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,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 266 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,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-20 18:29:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2022-02-20 18:29:43,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:43,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call 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,051 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call 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,051 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call 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,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,055 INFO L93 Difference]: Finished difference Result 217 states and 319 transitions. [2022-02-20 18:29:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2022-02-20 18:29:43,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:29:43,057 INFO L87 Difference]: Start difference. First operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:29:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,061 INFO L93 Difference]: Finished difference Result 217 states and 319 transitions. [2022-02-20 18:29:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2022-02-20 18:29:43,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:43,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call 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,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 318 transitions. [2022-02-20 18:29:43,066 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 318 transitions. Word has length 63 [2022-02-20 18:29:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:43,067 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 318 transitions. [2022-02-20 18:29:43,067 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,067 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 318 transitions. [2022-02-20 18:29:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:43,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:43,068 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,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:29:43,068 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:43,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1696985192, now seen corresponding path program 1 times [2022-02-20 18:29:43,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:43,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994620951] [2022-02-20 18:29:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:43,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {2681#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(35, 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; {2681#true} is VALID [2022-02-20 18:29:43,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {2681#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {2681#true} is VALID [2022-02-20 18:29:43,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {2681#true} assume 0 == ~r1~0; {2681#true} is VALID [2022-02-20 18:29:43,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {2681#true} assume ~id1~0 >= 0; {2681#true} is VALID [2022-02-20 18:29:43,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {2681#true} assume 0 == ~st1~0; {2681#true} is VALID [2022-02-20 18:29:43,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {2681#true} assume ~send1~0 == ~id1~0; {2681#true} is VALID [2022-02-20 18:29:43,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {2681#true} assume 0 == ~mode1~0 % 256; {2681#true} is VALID [2022-02-20 18:29:43,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {2681#true} assume ~id2~0 >= 0; {2681#true} is VALID [2022-02-20 18:29:43,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2681#true} assume 0 == ~st2~0; {2681#true} is VALID [2022-02-20 18:29:43,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {2681#true} assume ~send2~0 == ~id2~0; {2681#true} is VALID [2022-02-20 18:29:43,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {2681#true} assume 0 == ~mode2~0 % 256; {2681#true} is VALID [2022-02-20 18:29:43,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {2681#true} assume ~id3~0 >= 0; {2681#true} is VALID [2022-02-20 18:29:43,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {2681#true} assume 0 == ~st3~0; {2681#true} is VALID [2022-02-20 18:29:43,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {2681#true} assume ~send3~0 == ~id3~0; {2681#true} is VALID [2022-02-20 18:29:43,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {2681#true} assume 0 == ~mode3~0 % 256; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {2683#(= (+ (* (- 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; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {2683#(= (+ (* (- 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; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 10);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; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {2683#(= (+ (* (- 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; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {2683#(= (+ (* (- 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; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {2683#(= (+ (* (- 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; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {2683#(= (+ (* (- 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; {2683#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {2683#(= (+ (* (- 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; {2682#false} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {2682#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2682#false} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {2682#false} ~mode3~0 := 0; {2682#false} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {2682#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; {2682#false} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {2682#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2682#false} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {2682#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2682#false} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {2682#false} ~mode4~0 := 0; {2682#false} is VALID [2022-02-20 18:29:43,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {2682#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; {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {2682#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 55: Hoare triple {2682#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {2682#false} ~mode5~0 := 0; {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {2682#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; {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {2682#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 59: Hoare triple {2682#false} check_#res#1 := check_~tmp~1#1; {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {2682#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; {2682#false} is VALID [2022-02-20 18:29:43,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {2682#false} assume 0 == assert_~arg#1 % 256; {2682#false} is VALID [2022-02-20 18:29:43,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {2682#false} assume !false; {2682#false} is VALID [2022-02-20 18:29:43,134 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,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:43,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994620951] [2022-02-20 18:29:43,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994620951] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:43,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:43,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:43,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019740133] [2022-02-20 18:29:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:43,135 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,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:43,136 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,176 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,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:43,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:43,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:43,177 INFO L87 Difference]: Start difference. First operand 215 states and 318 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,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,317 INFO L93 Difference]: Finished difference Result 547 states and 840 transitions. [2022-02-20 18:29:43,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:43,317 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,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:43,317 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,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:43,319 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,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:43,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:29:43,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:43,503 INFO L225 Difference]: With dead ends: 547 [2022-02-20 18:29:43,503 INFO L226 Difference]: Without dead ends: 369 [2022-02-20 18:29:43,504 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,505 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 64 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 265 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,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 265 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,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-02-20 18:29:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2022-02-20 18:29:43,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:43,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call 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,517 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call 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,518 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call 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,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,526 INFO L93 Difference]: Finished difference Result 369 states and 555 transitions. [2022-02-20 18:29:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 555 transitions. [2022-02-20 18:29:43,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 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 369 states. [2022-02-20 18:29:43,527 INFO L87 Difference]: Start difference. First operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 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 369 states. [2022-02-20 18:29:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,535 INFO L93 Difference]: Finished difference Result 369 states and 555 transitions. [2022-02-20 18:29:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 555 transitions. [2022-02-20 18:29:43,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:43,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:43,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:43,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call 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,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 554 transitions. [2022-02-20 18:29:43,544 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 554 transitions. Word has length 63 [2022-02-20 18:29:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:43,544 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 554 transitions. [2022-02-20 18:29:43,544 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,545 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 554 transitions. [2022-02-20 18:29:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:43,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:43,545 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,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:29:43,545 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:43,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1003697422, now seen corresponding path program 1 times [2022-02-20 18:29:43,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:43,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297778488] [2022-02-20 18:29:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:43,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:43,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {4500#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(35, 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; {4500#true} is VALID [2022-02-20 18:29:43,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {4500#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {4500#true} assume 0 == ~r1~0; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {4500#true} assume ~id1~0 >= 0; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {4500#true} assume 0 == ~st1~0; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {4500#true} assume ~send1~0 == ~id1~0; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {4500#true} assume 0 == ~mode1~0 % 256; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {4500#true} assume ~id2~0 >= 0; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {4500#true} assume 0 == ~st2~0; {4500#true} is VALID [2022-02-20 18:29:43,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {4500#true} assume ~send2~0 == ~id2~0; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {4500#true} assume 0 == ~mode2~0 % 256; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {4500#true} assume ~id3~0 >= 0; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {4500#true} assume 0 == ~st3~0; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {4500#true} assume ~send3~0 == ~id3~0; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {4500#true} assume 0 == ~mode3~0 % 256; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {4500#true} assume ~id4~0 >= 0; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {4500#true} assume 0 == ~st4~0; {4500#true} is VALID [2022-02-20 18:29:43,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {4500#true} assume ~send4~0 == ~id4~0; {4500#true} is VALID [2022-02-20 18:29:43,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {4500#true} assume 0 == ~mode4~0 % 256; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 10);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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {4502#(= (+ (* (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; {4502#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {4502#(= (+ (* (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; {4501#false} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {4501#false} assume !(node4_~m4~0#1 != ~nomsg~0); {4501#false} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {4501#false} ~mode4~0 := 0; {4501#false} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {4501#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; {4501#false} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {4501#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4501#false} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {4501#false} assume !(node5_~m5~0#1 != ~nomsg~0); {4501#false} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {4501#false} ~mode5~0 := 0; {4501#false} is VALID [2022-02-20 18:29:43,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {4501#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; {4501#false} is VALID [2022-02-20 18:29:43,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {4501#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {4501#false} is VALID [2022-02-20 18:29:43,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {4501#false} check_#res#1 := check_~tmp~1#1; {4501#false} is VALID [2022-02-20 18:29:43,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {4501#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; {4501#false} is VALID [2022-02-20 18:29:43,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {4501#false} assume 0 == assert_~arg#1 % 256; {4501#false} is VALID [2022-02-20 18:29:43,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {4501#false} assume !false; {4501#false} is VALID [2022-02-20 18:29:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:43,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:43,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297778488] [2022-02-20 18:29:43,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297778488] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:43,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:43,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:43,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570604004] [2022-02-20 18:29:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:43,608 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,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:43,608 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,649 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,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:43,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:43,650 INFO L87 Difference]: Start difference. First operand 367 states and 554 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,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:43,823 INFO L93 Difference]: Finished difference Result 979 states and 1508 transitions. [2022-02-20 18:29:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:43,823 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,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:43,824 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,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:43,825 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,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:43,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:29:43,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:44,010 INFO L225 Difference]: With dead ends: 979 [2022-02-20 18:29:44,010 INFO L226 Difference]: Without dead ends: 649 [2022-02-20 18:29:44,011 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,011 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 60 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 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:44,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 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:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-02-20 18:29:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2022-02-20 18:29:44,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:44,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call 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,029 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call 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,030 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call 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,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,044 INFO L93 Difference]: Finished difference Result 649 states and 983 transitions. [2022-02-20 18:29:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 983 transitions. [2022-02-20 18:29:44,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:44,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:44,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 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 649 states. [2022-02-20 18:29:44,047 INFO L87 Difference]: Start difference. First operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 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 649 states. [2022-02-20 18:29:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,062 INFO L93 Difference]: Finished difference Result 649 states and 983 transitions. [2022-02-20 18:29:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 983 transitions. [2022-02-20 18:29:44,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:44,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:44,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:44,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call 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,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 982 transitions. [2022-02-20 18:29:44,081 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 982 transitions. Word has length 63 [2022-02-20 18:29:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:44,081 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 982 transitions. [2022-02-20 18:29:44,081 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,081 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 982 transitions. [2022-02-20 18:29:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:44,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:44,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:44,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:29:44,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1341490564, now seen corresponding path program 1 times [2022-02-20 18:29:44,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:44,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321920668] [2022-02-20 18:29:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:44,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {7751#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(35, 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; {7751#true} is VALID [2022-02-20 18:29:44,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {7751#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {7751#true} is VALID [2022-02-20 18:29:44,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {7751#true} assume 0 == ~r1~0; {7751#true} is VALID [2022-02-20 18:29:44,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {7751#true} assume ~id1~0 >= 0; {7751#true} is VALID [2022-02-20 18:29:44,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {7751#true} assume 0 == ~st1~0; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {7751#true} assume ~send1~0 == ~id1~0; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {7751#true} assume 0 == ~mode1~0 % 256; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {7751#true} assume ~id2~0 >= 0; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {7751#true} assume 0 == ~st2~0; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {7751#true} assume ~send2~0 == ~id2~0; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {7751#true} assume 0 == ~mode2~0 % 256; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {7751#true} assume ~id3~0 >= 0; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {7751#true} assume 0 == ~st3~0; {7751#true} is VALID [2022-02-20 18:29:44,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {7751#true} assume ~send3~0 == ~id3~0; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {7751#true} assume 0 == ~mode3~0 % 256; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {7751#true} assume ~id4~0 >= 0; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {7751#true} assume 0 == ~st4~0; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {7751#true} assume ~send4~0 == ~id4~0; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {7751#true} assume 0 == ~mode4~0 % 256; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {7751#true} assume ~id5~0 >= 0; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {7751#true} assume 0 == ~st5~0; {7751#true} is VALID [2022-02-20 18:29:44,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {7751#true} assume ~send5~0 == ~id5~0; {7751#true} is VALID [2022-02-20 18:29:44,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {7751#true} assume 0 == ~mode5~0 % 256; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main_~i2~0#1 < 10);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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {7753#(= (+ (* (- 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; {7753#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:29:44,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {7753#(= (+ (* (- 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; {7752#false} is VALID [2022-02-20 18:29:44,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {7752#false} assume !(node5_~m5~0#1 != ~nomsg~0); {7752#false} is VALID [2022-02-20 18:29:44,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {7752#false} ~mode5~0 := 0; {7752#false} is VALID [2022-02-20 18:29:44,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {7752#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; {7752#false} is VALID [2022-02-20 18:29:44,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {7752#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {7752#false} is VALID [2022-02-20 18:29:44,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {7752#false} check_#res#1 := check_~tmp~1#1; {7752#false} is VALID [2022-02-20 18:29:44,149 INFO L290 TraceCheckUtils]: 60: Hoare triple {7752#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; {7752#false} is VALID [2022-02-20 18:29:44,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {7752#false} assume 0 == assert_~arg#1 % 256; {7752#false} is VALID [2022-02-20 18:29:44,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {7752#false} assume !false; {7752#false} is VALID [2022-02-20 18:29:44,149 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,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:44,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321920668] [2022-02-20 18:29:44,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321920668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:44,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:44,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:44,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235825625] [2022-02-20 18:29:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:44,151 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:44,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:44,151 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:44,191 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,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:44,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:44,192 INFO L87 Difference]: Start difference. First operand 647 states and 982 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:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,437 INFO L93 Difference]: Finished difference Result 1771 states and 2712 transitions. [2022-02-20 18:29:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:44,438 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:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:44,438 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:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:44,439 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:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:44,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:29:44,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:44,664 INFO L225 Difference]: With dead ends: 1771 [2022-02-20 18:29:44,664 INFO L226 Difference]: Without dead ends: 1161 [2022-02-20 18:29:44,665 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,665 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 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,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 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,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-02-20 18:29:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1159. [2022-02-20 18:29:44,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:44,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1161 states. Second operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call 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,697 INFO L74 IsIncluded]: Start isIncluded. First operand 1161 states. Second operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call 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,699 INFO L87 Difference]: Start difference. First operand 1161 states. Second operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call 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,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,739 INFO L93 Difference]: Finished difference Result 1161 states and 1751 transitions. [2022-02-20 18:29:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1751 transitions. [2022-02-20 18:29:44,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:44,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:44,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 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 1161 states. [2022-02-20 18:29:44,743 INFO L87 Difference]: Start difference. First operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 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 1161 states. [2022-02-20 18:29:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:44,782 INFO L93 Difference]: Finished difference Result 1161 states and 1751 transitions. [2022-02-20 18:29:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1751 transitions. [2022-02-20 18:29:44,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:44,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:44,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:44,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call 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,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1750 transitions. [2022-02-20 18:29:44,838 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1750 transitions. Word has length 63 [2022-02-20 18:29:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:44,838 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 1750 transitions. [2022-02-20 18:29:44,838 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,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1750 transitions. [2022-02-20 18:29:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:44,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:44,839 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,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:29:44,839 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1735491334, now seen corresponding path program 1 times [2022-02-20 18:29:44,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:44,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234424018] [2022-02-20 18:29:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:44,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {13650#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(35, 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; {13650#true} is VALID [2022-02-20 18:29:44,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {13650#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {13650#true} is VALID [2022-02-20 18:29:44,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {13650#true} assume 0 == ~r1~0; {13650#true} is VALID [2022-02-20 18:29:44,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {13650#true} assume ~id1~0 >= 0; {13650#true} is VALID [2022-02-20 18:29:44,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {13650#true} assume 0 == ~st1~0; {13652#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {13652#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {13652#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {13652#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {13652#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {13652#(<= ~st1~0 0)} assume ~id2~0 >= 0; {13652#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:44,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {13652#(<= ~st1~0 0)} assume 0 == ~st2~0; {13653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {13653#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {13653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {13653#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {13653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {13653#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {13653#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {13653#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {13654#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {13655#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 10);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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {13656#(<= (+ ~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; {13656#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:44,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {13656#(<= (+ ~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; {13651#false} is VALID [2022-02-20 18:29:44,966 INFO L290 TraceCheckUtils]: 59: Hoare triple {13651#false} check_#res#1 := check_~tmp~1#1; {13651#false} is VALID [2022-02-20 18:29:44,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {13651#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; {13651#false} is VALID [2022-02-20 18:29:44,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {13651#false} assume 0 == assert_~arg#1 % 256; {13651#false} is VALID [2022-02-20 18:29:44,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {13651#false} assume !false; {13651#false} is VALID [2022-02-20 18:29:44,967 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,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:44,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234424018] [2022-02-20 18:29:44,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234424018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:44,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:44,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:29:44,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814011332] [2022-02-20 18:29:44,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:44,968 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,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:44,968 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:45,014 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:45,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:29:45,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:45,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:29:45,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:45,015 INFO L87 Difference]: Start difference. First operand 1159 states and 1750 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:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:55,200 INFO L93 Difference]: Finished difference Result 12379 states and 18880 transitions. [2022-02-20 18:29:55,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:29:55,201 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:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:55,202 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:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 939 transitions. [2022-02-20 18:29:55,235 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:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 939 transitions. [2022-02-20 18:29:55,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 939 transitions. [2022-02-20 18:29:55,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 939 edges. 939 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:00,076 INFO L225 Difference]: With dead ends: 12379 [2022-02-20 18:30:00,076 INFO L226 Difference]: Without dead ends: 11257 [2022-02-20 18:30:00,078 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:30:00,079 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 1317 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:00,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1317 Valid, 953 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11257 states. [2022-02-20 18:30:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11257 to 2279. [2022-02-20 18:30:01,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:01,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11257 states. Second operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call 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,138 INFO L74 IsIncluded]: Start isIncluded. First operand 11257 states. Second operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call 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,141 INFO L87 Difference]: Start difference. First operand 11257 states. Second operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call 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:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:04,392 INFO L93 Difference]: Finished difference Result 11257 states and 16847 transitions. [2022-02-20 18:30:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 11257 states and 16847 transitions. [2022-02-20 18:30:04,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:04,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:04,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 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 11257 states. [2022-02-20 18:30:04,409 INFO L87 Difference]: Start difference. First operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 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 11257 states. [2022-02-20 18:30:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,784 INFO L93 Difference]: Finished difference Result 11257 states and 16847 transitions. [2022-02-20 18:30:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 11257 states and 16847 transitions. [2022-02-20 18:30:07,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:07,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:07,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:07,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call 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:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3398 transitions. [2022-02-20 18:30:07,976 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3398 transitions. Word has length 63 [2022-02-20 18:30:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:07,978 INFO L470 AbstractCegarLoop]: Abstraction has 2279 states and 3398 transitions. [2022-02-20 18:30:07,978 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:30:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3398 transitions. [2022-02-20 18:30:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:30:07,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:07,982 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:30:07,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:30:07,983 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1519410410, now seen corresponding path program 1 times [2022-02-20 18:30:07,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:07,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144904153] [2022-02-20 18:30:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:08,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {54176#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(35, 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; {54176#true} is VALID [2022-02-20 18:30:08,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {54176#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {54176#true} is VALID [2022-02-20 18:30:08,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {54176#true} assume 0 == ~r1~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {54178#(<= ~r1~0 0)} assume ~id1~0 >= 0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~st1~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {54178#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {54178#(<= ~r1~0 0)} assume ~id2~0 >= 0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~st2~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {54178#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {54178#(<= ~r1~0 0)} assume ~id3~0 >= 0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~st3~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {54178#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {54178#(<= ~r1~0 0)} assume ~id4~0 >= 0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~st4~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {54178#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {54178#(<= ~r1~0 0)} assume ~id5~0 >= 0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~st5~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {54178#(<= ~r1~0 0)} assume ~send5~0 == ~id5~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {54178#(<= ~r1~0 0)} assume 0 == ~mode5~0 % 256; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {54178#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {54178#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {54178#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {54178#(<= ~r1~0 0)} assume ~id1~0 != ~id5~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {54178#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {54178#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {54178#(<= ~r1~0 0)} assume ~id2~0 != ~id5~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {54178#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {54178#(<= ~r1~0 0)} assume ~id3~0 != ~id5~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {54178#(<= ~r1~0 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {54178#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {54178#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {54178#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 10);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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {54178#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {54178#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {54178#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {54178#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {54178#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {54178#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {54178#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {54178#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {54178#(<= ~r1~0 0)} assume !(0 != ~mode5~0 % 256); {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {54178#(<= ~r1~0 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {54178#(<= ~r1~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; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,081 INFO L290 TraceCheckUtils]: 58: Hoare triple {54178#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {54178#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:08,081 INFO L290 TraceCheckUtils]: 59: Hoare triple {54178#(<= ~r1~0 0)} assume ~r1~0 >= 5; {54177#false} is VALID [2022-02-20 18:30:08,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {54177#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {54177#false} is VALID [2022-02-20 18:30:08,081 INFO L290 TraceCheckUtils]: 61: Hoare triple {54177#false} check_#res#1 := check_~tmp~1#1; {54177#false} is VALID [2022-02-20 18:30:08,081 INFO L290 TraceCheckUtils]: 62: Hoare triple {54177#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; {54177#false} is VALID [2022-02-20 18:30:08,081 INFO L290 TraceCheckUtils]: 63: Hoare triple {54177#false} assume 0 == assert_~arg#1 % 256; {54177#false} is VALID [2022-02-20 18:30:08,082 INFO L290 TraceCheckUtils]: 64: Hoare triple {54177#false} assume !false; {54177#false} is VALID [2022-02-20 18:30:08,082 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:08,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:08,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144904153] [2022-02-20 18:30:08,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144904153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:08,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:08,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:08,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28623883] [2022-02-20 18:30:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:08,083 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:30:08,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:08,083 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:30:08,117 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:30:08,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:08,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:08,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:08,118 INFO L87 Difference]: Start difference. First operand 2279 states and 3398 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:30:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:10,858 INFO L93 Difference]: Finished difference Result 5565 states and 8314 transitions. [2022-02-20 18:30:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:10,859 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:30:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:10,859 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:30:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2022-02-20 18:30:10,860 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:30:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2022-02-20 18:30:10,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 274 transitions. [2022-02-20 18:30:11,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:11,423 INFO L225 Difference]: With dead ends: 5565 [2022-02-20 18:30:11,423 INFO L226 Difference]: Without dead ends: 3323 [2022-02-20 18:30:11,425 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:11,425 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:11,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 226 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2022-02-20 18:30:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3321. [2022-02-20 18:30:12,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:12,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call 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:12,796 INFO L74 IsIncluded]: Start isIncluded. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call 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:12,814 INFO L87 Difference]: Start difference. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call 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:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:13,173 INFO L93 Difference]: Finished difference Result 3323 states and 4905 transitions. [2022-02-20 18:30:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4905 transitions. [2022-02-20 18:30:13,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:13,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:13,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:13,184 INFO L87 Difference]: Start difference. First operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:13,492 INFO L93 Difference]: Finished difference Result 3323 states and 4905 transitions. [2022-02-20 18:30:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4905 transitions. [2022-02-20 18:30:13,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:13,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:13,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:13,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call 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:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4904 transitions. [2022-02-20 18:30:13,873 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4904 transitions. Word has length 65 [2022-02-20 18:30:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:13,874 INFO L470 AbstractCegarLoop]: Abstraction has 3321 states and 4904 transitions. [2022-02-20 18:30:13,874 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:30:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4904 transitions. [2022-02-20 18:30:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:30:13,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:13,875 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:30:13,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:30:13,875 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1585903922, now seen corresponding path program 1 times [2022-02-20 18:30:13,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:13,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018813409] [2022-02-20 18:30:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:14,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {71733#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(35, 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; {71733#true} is VALID [2022-02-20 18:30:14,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {71733#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {71733#true} is VALID [2022-02-20 18:30:14,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {71733#true} assume 0 == ~r1~0; {71733#true} is VALID [2022-02-20 18:30:14,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {71733#true} assume ~id1~0 >= 0; {71733#true} is VALID [2022-02-20 18:30:14,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {71733#true} assume 0 == ~st1~0; {71735#(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:30:14,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {71735#(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; {71735#(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:30:14,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {71735#(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; {71735#(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:30:14,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {71735#(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; {71735#(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:30:14,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {71735#(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; {71736#(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:30:14,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {71736#(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; {71736#(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:30:14,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {71736#(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; {71736#(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:30:14,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {71736#(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; {71736#(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:30:14,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {71736#(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; {71737#(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:30:14,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {71737#(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; {71737#(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:30:14,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {71737#(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; {71737#(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:30:14,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {71737#(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; {71737#(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:30:14,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {71737#(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; {71738#(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:30:14,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {71738#(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; {71738#(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:30:14,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {71738#(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; {71738#(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:30:14,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {71738#(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; {71738#(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:30:14,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {71738#(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; {71739#(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:30:14,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {71739#(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; {71739#(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:30:14,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {71739#(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; {71739#(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:30:14,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {71739#(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; {71739#(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:30:14,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {71739#(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; {71739#(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:30:14,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {71739#(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; {71739#(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:30:14,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {71739#(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; {71739#(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:30:14,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {71739#(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; {71739#(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:30:14,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {71739#(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; {71739#(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:30:14,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {71739#(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; {71739#(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:30:14,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {71739#(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; {71739#(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:30:14,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {71739#(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; {71739#(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:30:14,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {71739#(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; {71739#(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:30:14,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {71739#(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; {71739#(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:30:14,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {71739#(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; {71739#(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:30:14,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {71739#(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); {71739#(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:30:14,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {71739#(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; {71739#(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:30:14,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {71739#(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 !!(main_~i2~0#1 < 10);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; {71739#(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:30:14,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {71739#(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); {71739#(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:30:14,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {71739#(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; {71739#(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:30:14,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {71739#(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; {71739#(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:30:14,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {71739#(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; {71739#(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:30:14,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {71739#(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); {71739#(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:30:14,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {71739#(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; {71739#(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:30:14,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {71739#(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; {71739#(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:30:14,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {71739#(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; {71739#(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:30:14,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {71739#(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); {71739#(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:30:14,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {71739#(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; {71739#(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:30:14,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {71739#(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; {71739#(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:30:14,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {71739#(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; {71739#(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:30:14,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {71739#(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); {71739#(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:30:14,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {71739#(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; {71739#(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:30:14,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {71739#(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; {71739#(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:30:14,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {71739#(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; {71739#(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:30:14,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {71739#(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); {71739#(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:30:14,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {71739#(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; {71739#(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:30:14,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {71739#(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; {71739#(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:30:14,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {71739#(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; {71739#(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:30:14,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {71739#(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; {71739#(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:30:14,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {71739#(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 >= 5); {71739#(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:30:14,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {71739#(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; {71734#false} is VALID [2022-02-20 18:30:14,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {71734#false} check_#res#1 := check_~tmp~1#1; {71734#false} is VALID [2022-02-20 18:30:14,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {71734#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; {71734#false} is VALID [2022-02-20 18:30:14,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {71734#false} assume 0 == assert_~arg#1 % 256; {71734#false} is VALID [2022-02-20 18:30:14,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {71734#false} assume !false; {71734#false} is VALID [2022-02-20 18:30:14,071 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:14,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:14,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018813409] [2022-02-20 18:30:14,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018813409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:14,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:14,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:30:14,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068445988] [2022-02-20 18:30:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:14,072 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:30:14,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:14,072 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:30:14,112 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:30:14,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:30:14,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:14,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:30:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:14,114 INFO L87 Difference]: Start difference. First operand 3321 states and 4904 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:30:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:18,103 INFO L93 Difference]: Finished difference Result 6605 states and 9770 transitions. [2022-02-20 18:30:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:30:18,103 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:30:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:18,104 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:30:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 281 transitions. [2022-02-20 18:30:18,105 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:30:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 281 transitions. [2022-02-20 18:30:18,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 281 transitions. [2022-02-20 18:30:18,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:18,650 INFO L225 Difference]: With dead ends: 6605 [2022-02-20 18:30:18,650 INFO L226 Difference]: Without dead ends: 3323 [2022-02-20 18:30:18,653 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:30:18,653 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 337 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:18,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 428 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2022-02-20 18:30:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3321. [2022-02-20 18:30:20,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:20,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call 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:20,015 INFO L74 IsIncluded]: Start isIncluded. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call 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:20,018 INFO L87 Difference]: Start difference. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call 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:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,348 INFO L93 Difference]: Finished difference Result 3323 states and 4857 transitions. [2022-02-20 18:30:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4857 transitions. [2022-02-20 18:30:20,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:20,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:20,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:20,360 INFO L87 Difference]: Start difference. First operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,724 INFO L93 Difference]: Finished difference Result 3323 states and 4857 transitions. [2022-02-20 18:30:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4857 transitions. [2022-02-20 18:30:20,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:20,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:20,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:20,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call 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:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4856 transitions. [2022-02-20 18:30:21,159 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4856 transitions. Word has length 65 [2022-02-20 18:30:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:21,159 INFO L470 AbstractCegarLoop]: Abstraction has 3321 states and 4856 transitions. [2022-02-20 18:30:21,160 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:30:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4856 transitions. [2022-02-20 18:30:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:30:21,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:21,160 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:30:21,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:30:21,160 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1503658279, now seen corresponding path program 1 times [2022-02-20 18:30:21,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:21,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340800936] [2022-02-20 18:30:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:21,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {90580#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(35, 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; {90580#true} is VALID [2022-02-20 18:30:21,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {90580#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {90580#true} is VALID [2022-02-20 18:30:21,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {90580#true} assume 0 == ~r1~0; {90580#true} is VALID [2022-02-20 18:30:21,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {90580#true} assume ~id1~0 >= 0; {90580#true} is VALID [2022-02-20 18:30:21,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {90580#true} assume 0 == ~st1~0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {90580#true} assume ~send1~0 == ~id1~0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {90580#true} assume 0 == ~mode1~0 % 256; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {90580#true} assume ~id2~0 >= 0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {90580#true} assume 0 == ~st2~0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {90580#true} assume ~send2~0 == ~id2~0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {90580#true} assume 0 == ~mode2~0 % 256; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {90580#true} assume ~id3~0 >= 0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {90580#true} assume 0 == ~st3~0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {90580#true} assume ~send3~0 == ~id3~0; {90580#true} is VALID [2022-02-20 18:30:21,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {90580#true} assume 0 == ~mode3~0 % 256; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {90580#true} assume ~id4~0 >= 0; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {90580#true} assume 0 == ~st4~0; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {90580#true} assume ~send4~0 == ~id4~0; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {90580#true} assume 0 == ~mode4~0 % 256; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {90580#true} assume ~id5~0 >= 0; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {90580#true} assume 0 == ~st5~0; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {90580#true} assume ~send5~0 == ~id5~0; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {90580#true} assume 0 == ~mode5~0 % 256; {90580#true} is VALID [2022-02-20 18:30:21,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {90580#true} assume ~id1~0 != ~id2~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {90580#true} assume ~id1~0 != ~id3~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {90580#true} assume ~id1~0 != ~id4~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {90580#true} assume ~id1~0 != ~id5~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {90580#true} assume ~id2~0 != ~id3~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {90580#true} assume ~id2~0 != ~id4~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {90580#true} assume ~id2~0 != ~id5~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {90580#true} assume ~id3~0 != ~id4~0; {90580#true} is VALID [2022-02-20 18:30:21,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {90580#true} assume ~id3~0 != ~id5~0; {90580#true} is VALID [2022-02-20 18:30:21,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {90580#true} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {90582#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:30:21,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {90582#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {90583#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:30:21,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {90583#(= |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; {90584#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:30:21,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {90584#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {90580#true} assume !!(main_~i2~0#1 < 10);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; {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {90580#true} assume !(0 != ~mode1~0 % 256); {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {90580#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {90580#true} assume !(0 != ~mode2~0 % 256); {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {90580#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {90580#true} is VALID [2022-02-20 18:30:21,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {90580#true} assume !(0 != ~mode3~0 % 256); {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {90580#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {90580#true} assume !(0 != ~mode4~0 % 256); {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {90580#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {90580#true} is VALID [2022-02-20 18:30:21,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {90580#true} assume !(0 != ~mode5~0 % 256); {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {90580#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {90580#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; {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {90580#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 59: Hoare triple {90580#true} assume !(~r1~0 >= 5); {90580#true} is VALID [2022-02-20 18:30:21,242 INFO L290 TraceCheckUtils]: 60: Hoare triple {90580#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {90580#true} is VALID [2022-02-20 18:30:21,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {90580#true} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {90585#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:30:21,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {90585#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {90586#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:30:21,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {90586#(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; {90587#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:30:21,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {90587#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {90581#false} is VALID [2022-02-20 18:30:21,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {90581#false} assume !false; {90581#false} is VALID [2022-02-20 18:30:21,245 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:21,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:21,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340800936] [2022-02-20 18:30:21,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340800936] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:21,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:21,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:30:21,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157586884] [2022-02-20 18:30:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:21,246 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:30:21,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:21,246 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:30:21,277 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:30:21,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:30:21,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:21,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:30:21,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:30:21,278 INFO L87 Difference]: Start difference. First operand 3321 states and 4856 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:30:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:27,543 INFO L93 Difference]: Finished difference Result 6164 states and 8906 transitions. [2022-02-20 18:30:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:30:27,543 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:30:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:27,544 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:30:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2022-02-20 18:30:27,545 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:30:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2022-02-20 18:30:27,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 205 transitions. [2022-02-20 18:30:27,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:29,075 INFO L225 Difference]: With dead ends: 6164 [2022-02-20 18:30:29,075 INFO L226 Difference]: Without dead ends: 6162 [2022-02-20 18:30:29,076 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:30:29,077 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 628 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:29,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 580 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2022-02-20 18:30:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 3513. [2022-02-20 18:30:31,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:31,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6162 states. Second operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call 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:31,905 INFO L74 IsIncluded]: Start isIncluded. First operand 6162 states. Second operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call 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:31,907 INFO L87 Difference]: Start difference. First operand 6162 states. Second operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call 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:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:33,126 INFO L93 Difference]: Finished difference Result 6162 states and 8825 transitions. [2022-02-20 18:30:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 8825 transitions. [2022-02-20 18:30:33,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:33,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:33,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 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 6162 states. [2022-02-20 18:30:33,140 INFO L87 Difference]: Start difference. First operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 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 6162 states. [2022-02-20 18:30:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:34,348 INFO L93 Difference]: Finished difference Result 6162 states and 8825 transitions. [2022-02-20 18:30:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 8825 transitions. [2022-02-20 18:30:34,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:34,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:34,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:34,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call 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:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 5032 transitions. [2022-02-20 18:30:34,809 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 5032 transitions. Word has length 66 [2022-02-20 18:30:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:34,809 INFO L470 AbstractCegarLoop]: Abstraction has 3513 states and 5032 transitions. [2022-02-20 18:30:34,810 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:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5032 transitions. [2022-02-20 18:30:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:30:34,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:34,812 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:34,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:30:34,812 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash 550206538, now seen corresponding path program 1 times [2022-02-20 18:30:34,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:34,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824932590] [2022-02-20 18:30:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:34,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {114921#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(35, 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; {114921#true} is VALID [2022-02-20 18:30:34,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {114921#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_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~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; {114921#true} is VALID [2022-02-20 18:30:34,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {114921#true} assume 0 == ~r1~0; {114921#true} is VALID [2022-02-20 18:30:34,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {114921#true} assume ~id1~0 >= 0; {114921#true} is VALID [2022-02-20 18:30:34,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {114921#true} assume 0 == ~st1~0; {114923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:34,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {114923#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {114923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:34,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {114923#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {114923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:34,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {114923#(<= ~st1~0 0)} assume ~id2~0 >= 0; {114923#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:34,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {114923#(<= ~st1~0 0)} assume 0 == ~st2~0; {114924#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {114924#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {114924#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {114924#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {114924#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {114924#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {114924#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {114924#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {114925#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 10);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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,928 INFO L290 TraceCheckUtils]: 64: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 10);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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,929 INFO L290 TraceCheckUtils]: 67: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,929 INFO L290 TraceCheckUtils]: 68: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,929 INFO L290 TraceCheckUtils]: 69: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,930 INFO L290 TraceCheckUtils]: 70: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,930 INFO L290 TraceCheckUtils]: 71: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,931 INFO L290 TraceCheckUtils]: 74: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,931 INFO L290 TraceCheckUtils]: 75: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,932 INFO L290 TraceCheckUtils]: 76: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 != ~nomsg~0); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,932 INFO L290 TraceCheckUtils]: 77: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,932 INFO L290 TraceCheckUtils]: 78: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,932 INFO L290 TraceCheckUtils]: 79: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,933 INFO L290 TraceCheckUtils]: 80: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node4_~m4~0#1 != ~nomsg~0); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,933 INFO L290 TraceCheckUtils]: 81: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,933 INFO L290 TraceCheckUtils]: 82: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,934 INFO L290 TraceCheckUtils]: 83: Hoare triple {114926#(<= (+ ~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; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,934 INFO L290 TraceCheckUtils]: 84: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume node5_~m5~0#1 != ~nomsg~0; {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,934 INFO L290 TraceCheckUtils]: 85: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node5_~m5~0#1 > ~id5~0); {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:34,935 INFO L290 TraceCheckUtils]: 86: Hoare triple {114926#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {114927#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:34,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {114927#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~mode5~0 := 0; {114927#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:34,935 INFO L290 TraceCheckUtils]: 88: Hoare triple {114927#(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; {114927#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:34,936 INFO L290 TraceCheckUtils]: 89: Hoare triple {114927#(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; {114922#false} is VALID [2022-02-20 18:30:34,936 INFO L290 TraceCheckUtils]: 90: Hoare triple {114922#false} check_#res#1 := check_~tmp~1#1; {114922#false} is VALID [2022-02-20 18:30:34,936 INFO L290 TraceCheckUtils]: 91: Hoare triple {114922#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; {114922#false} is VALID [2022-02-20 18:30:34,936 INFO L290 TraceCheckUtils]: 92: Hoare triple {114922#false} assume 0 == assert_~arg#1 % 256; {114922#false} is VALID [2022-02-20 18:30:34,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {114922#false} assume !false; {114922#false} is VALID [2022-02-20 18:30:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 18:30:34,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:34,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824932590] [2022-02-20 18:30:34,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824932590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:34,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:34,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:30:34,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951170704] [2022-02-20 18:30:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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:34,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:34,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call 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:34,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:34,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:30:34,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:30:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:34,998 INFO L87 Difference]: Start difference. First operand 3513 states and 5032 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)