./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:29:09,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:29:09,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:29:09,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:29:09,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:29:09,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:29:09,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:29:09,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:29:09,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:29:09,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:29:09,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:29:09,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:29:09,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:29:09,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:29:09,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:29:09,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:29:09,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:29:09,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:29:09,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:29:09,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:29:09,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:29:09,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:29:09,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:29:09,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:29:09,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:29:09,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:29:09,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:29:09,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:29:09,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:29:09,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:29:09,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:29:09,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:29:09,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:29:09,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:29:09,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:29:09,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:29:09,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:29:09,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:29:09,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:29:09,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:29:09,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:29:09,364 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:09,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:29:09,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:29:09,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:29:09,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:29:09,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:29:09,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:29:09,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:29:09,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:29:09,394 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:29:09,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:29:09,394 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:29:09,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:29:09,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:29:09,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:29:09,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:29:09,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:29:09,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:29:09,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:29:09,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:29:09,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:29:09,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:29:09,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:29:09,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:29:09,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:29:09,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:09,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:29:09,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:29:09,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:29:09,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:29:09,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:29:09,398 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:29:09,398 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:29:09,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:29:09,399 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 -> 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d [2022-02-20 18:29:09,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:29:09,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:29:09,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:29:09,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:29:09,651 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:29:09,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:09,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e19c32e/fb67c13553804b6596323575cca51077/FLAGcfde866d8 [2022-02-20 18:29:10,089 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:29:10,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:10,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e19c32e/fb67c13553804b6596323575cca51077/FLAGcfde866d8 [2022-02-20 18:29:10,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e19c32e/fb67c13553804b6596323575cca51077 [2022-02-20 18:29:10,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:29:10,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:29:10,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:10,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:29:10,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:29:10,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:10" (1/1) ... [2022-02-20 18:29:10,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156bbca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:10, skipping insertion in model container [2022-02-20 18:29:10,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:10" (1/1) ... [2022-02-20 18:29:10,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:29:10,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:29:10,352 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.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2022-02-20 18:29:10,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:10,361 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:29:10,397 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.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2022-02-20 18:29:10,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:10,410 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:29:10,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:10 WrapperNode [2022-02-20 18:29:10,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:10,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:10,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:29:10,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:29:10,421 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:10" (1/1) ... [2022-02-20 18:29:10,433 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:10" (1/1) ... [2022-02-20 18:29:10,472 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 275 [2022-02-20 18:29:10,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:10,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:29:10,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:29:10,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:29:10,479 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:10" (1/1) ... [2022-02-20 18:29:10,479 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:10" (1/1) ... [2022-02-20 18:29:10,482 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:10" (1/1) ... [2022-02-20 18:29:10,482 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:10" (1/1) ... [2022-02-20 18:29:10,487 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:10" (1/1) ... [2022-02-20 18:29:10,503 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:10" (1/1) ... [2022-02-20 18:29:10,505 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:10" (1/1) ... [2022-02-20 18:29:10,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:29:10,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:29:10,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:29:10,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:29:10,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:10" (1/1) ... [2022-02-20 18:29:10,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:10,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:10,556 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:10,580 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:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:29:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:29:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:29:10,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:29:10,710 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:29:10,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:29:11,117 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:29:11,122 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:29:11,135 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:29:11,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:11 BoogieIcfgContainer [2022-02-20 18:29:11,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:29:11,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:29:11,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:29:11,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:29:11,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:29:10" (1/3) ... [2022-02-20 18:29:11,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685aaf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:11, skipping insertion in model container [2022-02-20 18:29:11,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:10" (2/3) ... [2022-02-20 18:29:11,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685aaf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:11, skipping insertion in model container [2022-02-20 18:29:11,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:11" (3/3) ... [2022-02-20 18:29:11,145 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:11,163 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:29:11,164 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:29:11,219 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:29:11,231 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:11,231 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:29:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7012987012987013) internal successors, (131), 78 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call 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:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:29:11,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:11,268 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] [2022-02-20 18:29:11,268 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash -171388107, now seen corresponding path program 1 times [2022-02-20 18:29:11,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:11,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315553127] [2022-02-20 18:29:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:11,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {82#true} is VALID [2022-02-20 18:29:11,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {82#true} is VALID [2022-02-20 18:29:11,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {82#true} is VALID [2022-02-20 18:29:11,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#true} init_#res#1 := init_~tmp~0#1; {82#true} is VALID [2022-02-20 18:29:11,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#true} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {82#true} is VALID [2022-02-20 18:29:11,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {82#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {83#false} is VALID [2022-02-20 18:29:11,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#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;main_~i2~0#1 := 0; {83#false} is VALID [2022-02-20 18:29:11,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {83#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:29:11,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {83#false} assume !(0 != ~mode1~0 % 256); {83#false} is VALID [2022-02-20 18:29:11,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {83#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {83#false} is VALID [2022-02-20 18:29:11,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {83#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {83#false} is VALID [2022-02-20 18:29:11,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {83#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; {83#false} is VALID [2022-02-20 18:29:11,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {83#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:29:11,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {83#false} assume !(node2_~m2~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:29:11,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {83#false} ~mode2~0 := 0; {83#false} is VALID [2022-02-20 18:29:11,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {83#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; {83#false} is VALID [2022-02-20 18:29:11,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {83#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:29:11,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {83#false} assume !(node3_~m3~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:29:11,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {83#false} ~mode3~0 := 0; {83#false} is VALID [2022-02-20 18:29:11,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {83#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; {83#false} is VALID [2022-02-20 18:29:11,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {83#false} assume !(0 != ~mode4~0 % 256); {83#false} is VALID [2022-02-20 18:29:11,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {83#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {83#false} is VALID [2022-02-20 18:29:11,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {83#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {83#false} is VALID [2022-02-20 18:29:11,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {83#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {83#false} is VALID [2022-02-20 18:29:11,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {83#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {83#false} is VALID [2022-02-20 18:29:11,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {83#false} check_#res#1 := check_~tmp~1#1; {83#false} is VALID [2022-02-20 18:29:11,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {83#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {83#false} is VALID [2022-02-20 18:29:11,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {83#false} assume 0 == assert_~arg#1 % 256; {83#false} is VALID [2022-02-20 18:29:11,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {83#false} assume !false; {83#false} is VALID [2022-02-20 18:29:11,542 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:11,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:11,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315553127] [2022-02-20 18:29:11,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315553127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:11,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:11,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:29:11,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081938297] [2022-02-20 18:29:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:11,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:11,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:11,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:11,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:29:11,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:29:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:11,617 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7012987012987013) internal successors, (131), 78 states have internal predecessors, (131), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:11,711 INFO L93 Difference]: Finished difference Result 126 states and 207 transitions. [2022-02-20 18:29:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:29:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 207 transitions. [2022-02-20 18:29:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 207 transitions. [2022-02-20 18:29:11,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 207 transitions. [2022-02-20 18:29:11,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:11,907 INFO L225 Difference]: With dead ends: 126 [2022-02-20 18:29:11,907 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 18:29:11,909 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:11,913 INFO L933 BasicCegarLoop]: 124 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, 124 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:11,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 124 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:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 18:29:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-02-20 18:29:11,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:11,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 74 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:11,947 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 74 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:11,948 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 74 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:11,952 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2022-02-20 18:29:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 124 transitions. [2022-02-20 18:29:11,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:11,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:11,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 74 states have internal predecessors, (124), 0 states have call successors, (0), 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 75 states. [2022-02-20 18:29:11,957 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 74 states have internal predecessors, (124), 0 states have call successors, (0), 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 75 states. [2022-02-20 18:29:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:11,966 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2022-02-20 18:29:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 124 transitions. [2022-02-20 18:29:11,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:11,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:11,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:11,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 74 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call 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:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 124 transitions. [2022-02-20 18:29:11,986 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 124 transitions. Word has length 29 [2022-02-20 18:29:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:11,987 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 124 transitions. [2022-02-20 18:29:11,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 124 transitions. [2022-02-20 18:29:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:29:11,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:11,993 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] [2022-02-20 18:29:11,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:29:11,994 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:11,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash -305401613, now seen corresponding path program 1 times [2022-02-20 18:29:11,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:11,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542565956] [2022-02-20 18:29:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:12,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {461#true} is VALID [2022-02-20 18:29:12,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {461#true} is VALID [2022-02-20 18:29:12,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {463#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:29:12,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {463#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {464#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:29:12,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {464#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {465#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:29:12,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {462#false} is VALID [2022-02-20 18:29:12,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#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;main_~i2~0#1 := 0; {462#false} is VALID [2022-02-20 18:29:12,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {462#false} is VALID [2022-02-20 18:29:12,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#false} assume !(0 != ~mode1~0 % 256); {462#false} is VALID [2022-02-20 18:29:12,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {462#false} is VALID [2022-02-20 18:29:12,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {462#false} is VALID [2022-02-20 18:29:12,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#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; {462#false} is VALID [2022-02-20 18:29:12,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {462#false} is VALID [2022-02-20 18:29:12,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {462#false} assume !(node2_~m2~0#1 != ~nomsg~0); {462#false} is VALID [2022-02-20 18:29:12,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#false} ~mode2~0 := 0; {462#false} is VALID [2022-02-20 18:29:12,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {462#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; {462#false} is VALID [2022-02-20 18:29:12,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {462#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {462#false} is VALID [2022-02-20 18:29:12,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {462#false} assume !(node3_~m3~0#1 != ~nomsg~0); {462#false} is VALID [2022-02-20 18:29:12,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {462#false} ~mode3~0 := 0; {462#false} is VALID [2022-02-20 18:29:12,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {462#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; {462#false} is VALID [2022-02-20 18:29:12,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {462#false} assume !(0 != ~mode4~0 % 256); {462#false} is VALID [2022-02-20 18:29:12,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {462#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {462#false} is VALID [2022-02-20 18:29:12,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {462#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {462#false} is VALID [2022-02-20 18:29:12,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {462#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {462#false} is VALID [2022-02-20 18:29:12,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {462#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {462#false} is VALID [2022-02-20 18:29:12,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {462#false} check_#res#1 := check_~tmp~1#1; {462#false} is VALID [2022-02-20 18:29:12,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {462#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {462#false} is VALID [2022-02-20 18:29:12,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {462#false} assume 0 == assert_~arg#1 % 256; {462#false} is VALID [2022-02-20 18:29:12,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-02-20 18:29:12,137 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:12,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:12,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542565956] [2022-02-20 18:29:12,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542565956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:12,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:12,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:12,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104248332] [2022-02-20 18:29:12,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:12,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:12,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:12,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:12,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:12,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:12,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:12,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:12,179 INFO L87 Difference]: Start difference. First operand 75 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:12,443 INFO L93 Difference]: Finished difference Result 125 states and 200 transitions. [2022-02-20 18:29:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:12,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2022-02-20 18:29:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2022-02-20 18:29:12,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 200 transitions. [2022-02-20 18:29:12,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:12,621 INFO L225 Difference]: With dead ends: 125 [2022-02-20 18:29:12,621 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 18:29:12,621 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:12,622 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:12,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 462 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 18:29:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-02-20 18:29:12,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:12,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:12,628 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:12,629 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:12,631 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-02-20 18:29:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2022-02-20 18:29:12,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:12,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:12,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 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 75 states. [2022-02-20 18:29:12,633 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 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 75 states. [2022-02-20 18:29:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:12,636 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-02-20 18:29:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2022-02-20 18:29:12,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:12,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:12,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:12,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2022-02-20 18:29:12,640 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 29 [2022-02-20 18:29:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:12,640 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2022-02-20 18:29:12,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2022-02-20 18:29:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:12,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:12,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:12,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:29:12,643 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1295954354, now seen corresponding path program 1 times [2022-02-20 18:29:12,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:12,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355409910] [2022-02-20 18:29:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:12,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {846#true} is VALID [2022-02-20 18:29:12,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {846#true} is VALID [2022-02-20 18:29:12,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {846#true} assume 0 == ~r1~0 % 256; {846#true} is VALID [2022-02-20 18:29:12,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {846#true} assume ~id1~0 >= 0; {846#true} is VALID [2022-02-20 18:29:12,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {846#true} assume 0 == ~st1~0; {846#true} is VALID [2022-02-20 18:29:12,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {846#true} assume ~send1~0 == ~id1~0; {846#true} is VALID [2022-02-20 18:29:12,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {846#true} assume 0 == ~mode1~0 % 256; {846#true} is VALID [2022-02-20 18:29:12,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {846#true} assume ~id2~0 >= 0; {846#true} is VALID [2022-02-20 18:29:12,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {846#true} assume 0 == ~st2~0; {846#true} is VALID [2022-02-20 18:29:12,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#true} assume ~send2~0 == ~id2~0; {846#true} is VALID [2022-02-20 18:29:12,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#true} assume 0 == ~mode2~0 % 256; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {848#(= (+ (* (- 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;main_~i2~0#1 := 0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {848#(= (+ (* (- 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; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {848#(= (+ (* (- 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; {848#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:12,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {848#(= (+ (* (- 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; {847#false} is VALID [2022-02-20 18:29:12,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {847#false} assume !(node2_~m2~0#1 != ~nomsg~0); {847#false} is VALID [2022-02-20 18:29:12,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {847#false} ~mode2~0 := 0; {847#false} is VALID [2022-02-20 18:29:12,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {847#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; {847#false} is VALID [2022-02-20 18:29:12,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {847#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {847#false} is VALID [2022-02-20 18:29:12,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {847#false} assume !(node3_~m3~0#1 != ~nomsg~0); {847#false} is VALID [2022-02-20 18:29:12,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {847#false} ~mode3~0 := 0; {847#false} is VALID [2022-02-20 18:29:12,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {847#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; {847#false} is VALID [2022-02-20 18:29:12,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {847#false} assume !(0 != ~mode4~0 % 256); {847#false} is VALID [2022-02-20 18:29:12,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {847#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {847#false} is VALID [2022-02-20 18:29:12,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {847#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {847#false} is VALID [2022-02-20 18:29:12,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {847#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {847#false} is VALID [2022-02-20 18:29:12,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {847#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {847#false} is VALID [2022-02-20 18:29:12,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {847#false} check_#res#1 := check_~tmp~1#1; {847#false} is VALID [2022-02-20 18:29:12,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {847#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {847#false} is VALID [2022-02-20 18:29:12,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {847#false} assume 0 == assert_~arg#1 % 256; {847#false} is VALID [2022-02-20 18:29:12,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {847#false} assume !false; {847#false} is VALID [2022-02-20 18:29:12,748 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:12,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:12,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355409910] [2022-02-20 18:29:12,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355409910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:12,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:12,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:12,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793814494] [2022-02-20 18:29:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:12,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:12,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:12,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:12,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:12,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:12,793 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:12,949 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-02-20 18:29:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2022-02-20 18:29:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2022-02-20 18:29:12,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 235 transitions. [2022-02-20 18:29:13,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:13,150 INFO L225 Difference]: With dead ends: 161 [2022-02-20 18:29:13,150 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 18:29:13,150 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:13,151 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 58 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 217 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:13,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 217 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:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 18:29:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-02-20 18:29:13,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:13,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call 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:13,160 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call 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:13,161 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call 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:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:13,165 INFO L93 Difference]: Finished difference Result 115 states and 162 transitions. [2022-02-20 18:29:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 162 transitions. [2022-02-20 18:29:13,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:13,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:13,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 states have internal predecessors, (161), 0 states have call successors, (0), 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 115 states. [2022-02-20 18:29:13,167 INFO L87 Difference]: Start difference. First operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 states have internal predecessors, (161), 0 states have call successors, (0), 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 115 states. [2022-02-20 18:29:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:13,174 INFO L93 Difference]: Finished difference Result 115 states and 162 transitions. [2022-02-20 18:29:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 162 transitions. [2022-02-20 18:29:13,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:13,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:13,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:13,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call 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:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2022-02-20 18:29:13,183 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 51 [2022-02-20 18:29:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:13,184 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2022-02-20 18:29:13,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2022-02-20 18:29:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:13,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:13,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:13,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:29:13,188 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1404728260, now seen corresponding path program 1 times [2022-02-20 18:29:13,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:13,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017692512] [2022-02-20 18:29:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:13,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:13,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {1392#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {1392#true} is VALID [2022-02-20 18:29:13,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1392#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1392#true} is VALID [2022-02-20 18:29:13,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1392#true} assume 0 == ~r1~0 % 256; {1392#true} is VALID [2022-02-20 18:29:13,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {1392#true} assume ~id1~0 >= 0; {1392#true} is VALID [2022-02-20 18:29:13,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {1392#true} assume 0 == ~st1~0; {1392#true} is VALID [2022-02-20 18:29:13,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1392#true} assume ~send1~0 == ~id1~0; {1392#true} is VALID [2022-02-20 18:29:13,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {1392#true} assume 0 == ~mode1~0 % 256; {1392#true} is VALID [2022-02-20 18:29:13,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {1392#true} assume ~id2~0 >= 0; {1392#true} is VALID [2022-02-20 18:29:13,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {1392#true} assume 0 == ~st2~0; {1392#true} is VALID [2022-02-20 18:29:13,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {1392#true} assume ~send2~0 == ~id2~0; {1392#true} is VALID [2022-02-20 18:29:13,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {1392#true} assume 0 == ~mode2~0 % 256; {1392#true} is VALID [2022-02-20 18:29:13,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {1392#true} assume ~id3~0 >= 0; {1392#true} is VALID [2022-02-20 18:29:13,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {1392#true} assume 0 == ~st3~0; {1392#true} is VALID [2022-02-20 18:29:13,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {1392#true} assume ~send3~0 == ~id3~0; {1392#true} is VALID [2022-02-20 18:29:13,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {1392#true} assume 0 == ~mode3~0 % 256; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {1394#(= (+ (* (- 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;main_~i2~0#1 := 0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {1394#(= (+ (* (- 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; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {1394#(= (+ (* (- 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; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {1394#(= (+ (* (- 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; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {1394#(= (+ (* (- 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; {1394#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:13,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {1394#(= (+ (* (- 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; {1393#false} is VALID [2022-02-20 18:29:13,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {1393#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1393#false} is VALID [2022-02-20 18:29:13,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {1393#false} ~mode3~0 := 0; {1393#false} is VALID [2022-02-20 18:29:13,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {1393#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; {1393#false} is VALID [2022-02-20 18:29:13,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {1393#false} assume !(0 != ~mode4~0 % 256); {1393#false} is VALID [2022-02-20 18:29:13,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {1393#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {1393#false} is VALID [2022-02-20 18:29:13,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {1393#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {1393#false} is VALID [2022-02-20 18:29:13,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {1393#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1393#false} is VALID [2022-02-20 18:29:13,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {1393#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1393#false} is VALID [2022-02-20 18:29:13,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {1393#false} check_#res#1 := check_~tmp~1#1; {1393#false} is VALID [2022-02-20 18:29:13,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {1393#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {1393#false} is VALID [2022-02-20 18:29:13,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {1393#false} assume 0 == assert_~arg#1 % 256; {1393#false} is VALID [2022-02-20 18:29:13,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {1393#false} assume !false; {1393#false} is VALID [2022-02-20 18:29:13,340 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:13,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:13,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017692512] [2022-02-20 18:29:13,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017692512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:13,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:13,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:13,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009403240] [2022-02-20 18:29:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:13,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:13,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:13,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:13,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:13,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:13,395 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:13,556 INFO L93 Difference]: Finished difference Result 269 states and 405 transitions. [2022-02-20 18:29:13,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2022-02-20 18:29:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2022-02-20 18:29:13,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 235 transitions. [2022-02-20 18:29:13,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:13,739 INFO L225 Difference]: With dead ends: 269 [2022-02-20 18:29:13,739 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 18:29:13,740 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:13,741 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 54 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 216 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:13,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 216 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:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 18:29:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-02-20 18:29:13,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:13,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 182 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call 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:13,757 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 182 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call 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:13,758 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 182 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call 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:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:13,766 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2022-02-20 18:29:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2022-02-20 18:29:13,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:13,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:13,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 182 states have internal predecessors, (270), 0 states have call successors, (0), 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 185 states. [2022-02-20 18:29:13,767 INFO L87 Difference]: Start difference. First operand has 183 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 182 states have internal predecessors, (270), 0 states have call successors, (0), 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 185 states. [2022-02-20 18:29:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:13,773 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2022-02-20 18:29:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2022-02-20 18:29:13,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:13,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:13,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:13,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 182 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call 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:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 270 transitions. [2022-02-20 18:29:13,781 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 270 transitions. Word has length 51 [2022-02-20 18:29:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:13,782 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 270 transitions. [2022-02-20 18:29:13,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 270 transitions. [2022-02-20 18:29:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:13,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:13,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:13,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:29:13,786 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1742521402, now seen corresponding path program 1 times [2022-02-20 18:29:13,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:13,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076784575] [2022-02-20 18:29:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:13,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {2291#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {2291#true} is VALID [2022-02-20 18:29:13,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2291#true} is VALID [2022-02-20 18:29:13,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {2291#true} assume 0 == ~r1~0 % 256; {2291#true} is VALID [2022-02-20 18:29:13,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {2291#true} assume ~id1~0 >= 0; {2291#true} is VALID [2022-02-20 18:29:13,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {2291#true} assume 0 == ~st1~0; {2293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:13,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {2293#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:13,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {2293#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:13,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {2293#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:13,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {2293#(<= ~st1~0 0)} assume 0 == ~st2~0; {2294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2294#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {2294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {2294#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {2294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {2294#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {2294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {2294#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {2295#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {2296#(<= (+ ~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;main_~i2~0#1 := 0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {2296#(<= (+ ~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; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:13,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {2296#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {2292#false} is VALID [2022-02-20 18:29:13,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {2292#false} check_#res#1 := check_~tmp~1#1; {2292#false} is VALID [2022-02-20 18:29:13,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {2292#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {2292#false} is VALID [2022-02-20 18:29:13,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {2292#false} assume 0 == assert_~arg#1 % 256; {2292#false} is VALID [2022-02-20 18:29:13,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {2292#false} assume !false; {2292#false} is VALID [2022-02-20 18:29:13,937 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:13,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:13,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076784575] [2022-02-20 18:29:13,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076784575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:13,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:13,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:13,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348455734] [2022-02-20 18:29:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:13,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:13,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:13,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:13,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:13,986 INFO L87 Difference]: Start difference. First operand 183 states and 270 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:15,183 INFO L93 Difference]: Finished difference Result 1415 states and 2198 transitions. [2022-02-20 18:29:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:29:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:29:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 677 transitions. [2022-02-20 18:29:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 677 transitions. [2022-02-20 18:29:15,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 677 transitions. [2022-02-20 18:29:15,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:15,783 INFO L225 Difference]: With dead ends: 1415 [2022-02-20 18:29:15,784 INFO L226 Difference]: Without dead ends: 1261 [2022-02-20 18:29:15,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:29:15,786 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 761 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:15,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 862 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:29:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-02-20 18:29:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 335. [2022-02-20 18:29:15,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:15,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1261 states. Second operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call 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:15,900 INFO L74 IsIncluded]: Start isIncluded. First operand 1261 states. Second operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call 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:15,901 INFO L87 Difference]: Start difference. First operand 1261 states. Second operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call 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:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:15,975 INFO L93 Difference]: Finished difference Result 1261 states and 1925 transitions. [2022-02-20 18:29:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1925 transitions. [2022-02-20 18:29:15,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:15,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:15,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 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 1261 states. [2022-02-20 18:29:15,979 INFO L87 Difference]: Start difference. First operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 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 1261 states. [2022-02-20 18:29:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:16,052 INFO L93 Difference]: Finished difference Result 1261 states and 1925 transitions. [2022-02-20 18:29:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1925 transitions. [2022-02-20 18:29:16,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:16,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:16,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:16,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call 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:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 502 transitions. [2022-02-20 18:29:16,075 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 502 transitions. Word has length 51 [2022-02-20 18:29:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:16,075 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 502 transitions. [2022-02-20 18:29:16,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 502 transitions. [2022-02-20 18:29:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:29:16,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:16,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:16,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:29:16,077 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1889876246, now seen corresponding path program 1 times [2022-02-20 18:29:16,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:16,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638938089] [2022-02-20 18:29:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:16,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {6892#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {6892#true} is VALID [2022-02-20 18:29:16,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {6892#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6892#true} is VALID [2022-02-20 18:29:16,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {6892#true} assume 0 == ~r1~0 % 256; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:29:16,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {6894#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 4; {6893#false} is VALID [2022-02-20 18:29:16,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {6893#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {6893#false} is VALID [2022-02-20 18:29:16,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {6893#false} check_#res#1 := check_~tmp~1#1; {6893#false} is VALID [2022-02-20 18:29:16,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {6893#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {6893#false} is VALID [2022-02-20 18:29:16,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {6893#false} assume 0 == assert_~arg#1 % 256; {6893#false} is VALID [2022-02-20 18:29:16,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {6893#false} assume !false; {6893#false} is VALID [2022-02-20 18:29:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:16,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:16,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638938089] [2022-02-20 18:29:16,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638938089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:16,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:16,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:16,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541917902] [2022-02-20 18:29:16,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:16,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:16,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:16,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:16,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:16,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:16,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:16,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:16,225 INFO L87 Difference]: Start difference. First operand 335 states and 502 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:16,630 INFO L93 Difference]: Finished difference Result 903 states and 1372 transitions. [2022-02-20 18:29:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2022-02-20 18:29:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2022-02-20 18:29:16,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 236 transitions. [2022-02-20 18:29:16,818 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:16,837 INFO L225 Difference]: With dead ends: 903 [2022-02-20 18:29:16,837 INFO L226 Difference]: Without dead ends: 597 [2022-02-20 18:29:16,838 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:16,839 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:16,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 162 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-02-20 18:29:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 587. [2022-02-20 18:29:17,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:17,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand has 587 states, 586 states have (on average 1.484641638225256) internal successors, (870), 586 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call 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:17,048 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand has 587 states, 586 states have (on average 1.484641638225256) internal successors, (870), 586 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call 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:17,049 INFO L87 Difference]: Start difference. First operand 597 states. Second operand has 587 states, 586 states have (on average 1.484641638225256) internal successors, (870), 586 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call 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:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:17,067 INFO L93 Difference]: Finished difference Result 597 states and 879 transitions. [2022-02-20 18:29:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 879 transitions. [2022-02-20 18:29:17,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:17,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:17,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 587 states, 586 states have (on average 1.484641638225256) internal successors, (870), 586 states have internal predecessors, (870), 0 states have call successors, (0), 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 597 states. [2022-02-20 18:29:17,071 INFO L87 Difference]: Start difference. First operand has 587 states, 586 states have (on average 1.484641638225256) internal successors, (870), 586 states have internal predecessors, (870), 0 states have call successors, (0), 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 597 states. [2022-02-20 18:29:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:17,090 INFO L93 Difference]: Finished difference Result 597 states and 879 transitions. [2022-02-20 18:29:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 879 transitions. [2022-02-20 18:29:17,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:17,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:17,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:17,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.484641638225256) internal successors, (870), 586 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call 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:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 870 transitions. [2022-02-20 18:29:17,113 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 870 transitions. Word has length 53 [2022-02-20 18:29:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:17,114 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 870 transitions. [2022-02-20 18:29:17,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 870 transitions. [2022-02-20 18:29:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:29:17,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:17,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:17,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:29:17,115 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1823382734, now seen corresponding path program 1 times [2022-02-20 18:29:17,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:17,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708887422] [2022-02-20 18:29:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:17,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {9855#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {9855#true} is VALID [2022-02-20 18:29:17,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {9855#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {9855#true} is VALID [2022-02-20 18:29:17,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {9855#true} assume 0 == ~r1~0 % 256; {9855#true} is VALID [2022-02-20 18:29:17,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {9855#true} assume ~id1~0 >= 0; {9855#true} is VALID [2022-02-20 18:29:17,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {9855#true} assume 0 == ~st1~0; {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {9857#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {9858#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {9859#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == assume_abort_if_not_~cond#1); {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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;main_~i2~0#1 := 0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {9860#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {9856#false} is VALID [2022-02-20 18:29:17,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {9856#false} check_#res#1 := check_~tmp~1#1; {9856#false} is VALID [2022-02-20 18:29:17,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {9856#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {9856#false} is VALID [2022-02-20 18:29:17,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {9856#false} assume 0 == assert_~arg#1 % 256; {9856#false} is VALID [2022-02-20 18:29:17,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {9856#false} assume !false; {9856#false} is VALID [2022-02-20 18:29:17,334 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:17,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:17,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708887422] [2022-02-20 18:29:17,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708887422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:17,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:17,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:17,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806019657] [2022-02-20 18:29:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:17,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:17,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:17,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:17,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:17,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:17,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:17,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:17,379 INFO L87 Difference]: Start difference. First operand 587 states and 870 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:18,097 INFO L93 Difference]: Finished difference Result 1147 states and 1712 transitions. [2022-02-20 18:29:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2022-02-20 18:29:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2022-02-20 18:29:18,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 243 transitions. [2022-02-20 18:29:18,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:18,299 INFO L225 Difference]: With dead ends: 1147 [2022-02-20 18:29:18,299 INFO L226 Difference]: Without dead ends: 589 [2022-02-20 18:29:18,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:18,301 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 200 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:18,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 321 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-02-20 18:29:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2022-02-20 18:29:18,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:18,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand has 587 states, 586 states have (on average 1.47098976109215) internal successors, (862), 586 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call 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:18,581 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand has 587 states, 586 states have (on average 1.47098976109215) internal successors, (862), 586 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call 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:18,582 INFO L87 Difference]: Start difference. First operand 589 states. Second operand has 587 states, 586 states have (on average 1.47098976109215) internal successors, (862), 586 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call 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:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:18,601 INFO L93 Difference]: Finished difference Result 589 states and 863 transitions. [2022-02-20 18:29:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 863 transitions. [2022-02-20 18:29:18,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:18,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:18,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 587 states, 586 states have (on average 1.47098976109215) internal successors, (862), 586 states have internal predecessors, (862), 0 states have call successors, (0), 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 589 states. [2022-02-20 18:29:18,604 INFO L87 Difference]: Start difference. First operand has 587 states, 586 states have (on average 1.47098976109215) internal successors, (862), 586 states have internal predecessors, (862), 0 states have call successors, (0), 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 589 states. [2022-02-20 18:29:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:18,621 INFO L93 Difference]: Finished difference Result 589 states and 863 transitions. [2022-02-20 18:29:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 863 transitions. [2022-02-20 18:29:18,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:18,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:18,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:18,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.47098976109215) internal successors, (862), 586 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call 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:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 862 transitions. [2022-02-20 18:29:18,643 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 862 transitions. Word has length 53 [2022-02-20 18:29:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:18,644 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 862 transitions. [2022-02-20 18:29:18,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 862 transitions. [2022-02-20 18:29:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:29:18,645 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:18,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:18,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:29:18,646 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash -34468658, now seen corresponding path program 1 times [2022-02-20 18:29:18,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:18,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809921361] [2022-02-20 18:29:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:18,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {13105#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {13105#true} is VALID [2022-02-20 18:29:18,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {13105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {13105#true} is VALID [2022-02-20 18:29:18,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {13105#true} assume 0 == ~r1~0 % 256; {13105#true} is VALID [2022-02-20 18:29:18,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {13105#true} assume ~id1~0 >= 0; {13105#true} is VALID [2022-02-20 18:29:18,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {13105#true} assume 0 == ~st1~0; {13105#true} is VALID [2022-02-20 18:29:18,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {13105#true} assume ~send1~0 == ~id1~0; {13105#true} is VALID [2022-02-20 18:29:18,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {13105#true} assume 0 == ~mode1~0 % 256; {13105#true} is VALID [2022-02-20 18:29:18,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {13105#true} assume ~id2~0 >= 0; {13105#true} is VALID [2022-02-20 18:29:18,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {13105#true} assume 0 == ~st2~0; {13105#true} is VALID [2022-02-20 18:29:18,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {13105#true} assume ~send2~0 == ~id2~0; {13105#true} is VALID [2022-02-20 18:29:18,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {13105#true} assume 0 == ~mode2~0 % 256; {13105#true} is VALID [2022-02-20 18:29:18,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {13105#true} assume ~id3~0 >= 0; {13105#true} is VALID [2022-02-20 18:29:18,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {13105#true} assume 0 == ~st3~0; {13105#true} is VALID [2022-02-20 18:29:18,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {13105#true} assume ~send3~0 == ~id3~0; {13105#true} is VALID [2022-02-20 18:29:18,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {13105#true} assume 0 == ~mode3~0 % 256; {13105#true} is VALID [2022-02-20 18:29:18,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {13105#true} assume ~id4~0 >= 0; {13105#true} is VALID [2022-02-20 18:29:18,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {13105#true} assume 0 == ~st4~0; {13105#true} is VALID [2022-02-20 18:29:18,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {13105#true} assume ~send4~0 == ~id4~0; {13105#true} is VALID [2022-02-20 18:29:18,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {13105#true} assume 0 == ~mode4~0 % 256; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {13107#(= (+ (* (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;main_~i2~0#1 := 0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {13107#(= (+ (* (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; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {13107#(= (+ (* (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; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {13107#(= (+ (* (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; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {13107#(= (+ (* (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; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {13107#(= (+ (* (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; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {13107#(= (+ (* (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; {13107#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:18,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {13107#(= (+ (* (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; {13106#false} is VALID [2022-02-20 18:29:18,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {13106#false} assume node4_~m4~0#1 != ~nomsg~0; {13106#false} is VALID [2022-02-20 18:29:18,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {13106#false} assume !(node4_~m4~0#1 > ~id4~0); {13106#false} is VALID [2022-02-20 18:29:18,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {13106#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {13106#false} is VALID [2022-02-20 18:29:18,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {13106#false} ~mode4~0 := 0; {13106#false} is VALID [2022-02-20 18:29:18,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {13106#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13106#false} is VALID [2022-02-20 18:29:18,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {13106#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {13106#false} is VALID [2022-02-20 18:29:18,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {13106#false} check_#res#1 := check_~tmp~1#1; {13106#false} is VALID [2022-02-20 18:29:18,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {13106#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {13106#false} is VALID [2022-02-20 18:29:18,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {13106#false} assume 0 == assert_~arg#1 % 256; {13106#false} is VALID [2022-02-20 18:29:18,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {13106#false} assume !false; {13106#false} is VALID [2022-02-20 18:29:18,744 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:18,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:18,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809921361] [2022-02-20 18:29:18,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809921361] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:18,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:18,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:18,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440029515] [2022-02-20 18:29:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:18,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:18,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:18,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:18,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:18,785 INFO L87 Difference]: Start difference. First operand 587 states and 862 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:19,566 INFO L93 Difference]: Finished difference Result 1607 states and 2368 transitions. [2022-02-20 18:29:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:19,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2022-02-20 18:29:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2022-02-20 18:29:19,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 235 transitions. [2022-02-20 18:29:19,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:19,797 INFO L225 Difference]: With dead ends: 1607 [2022-02-20 18:29:19,798 INFO L226 Difference]: Without dead ends: 1049 [2022-02-20 18:29:19,799 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:19,799 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 216 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:19,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 216 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:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-02-20 18:29:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2022-02-20 18:29:20,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:20,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1049 states. Second operand has 1047 states, 1046 states have (on average 1.4512428298279159) internal successors, (1518), 1046 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call 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:20,261 INFO L74 IsIncluded]: Start isIncluded. First operand 1049 states. Second operand has 1047 states, 1046 states have (on average 1.4512428298279159) internal successors, (1518), 1046 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call 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:20,262 INFO L87 Difference]: Start difference. First operand 1049 states. Second operand has 1047 states, 1046 states have (on average 1.4512428298279159) internal successors, (1518), 1046 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call 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:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:20,311 INFO L93 Difference]: Finished difference Result 1049 states and 1519 transitions. [2022-02-20 18:29:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1519 transitions. [2022-02-20 18:29:20,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:20,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:20,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 1047 states, 1046 states have (on average 1.4512428298279159) internal successors, (1518), 1046 states have internal predecessors, (1518), 0 states have call successors, (0), 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 1049 states. [2022-02-20 18:29:20,316 INFO L87 Difference]: Start difference. First operand has 1047 states, 1046 states have (on average 1.4512428298279159) internal successors, (1518), 1046 states have internal predecessors, (1518), 0 states have call successors, (0), 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 1049 states. [2022-02-20 18:29:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:20,363 INFO L93 Difference]: Finished difference Result 1049 states and 1519 transitions. [2022-02-20 18:29:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1519 transitions. [2022-02-20 18:29:20,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:20,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:20,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:20,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.4512428298279159) internal successors, (1518), 1046 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call 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:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1518 transitions. [2022-02-20 18:29:20,431 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1518 transitions. Word has length 53 [2022-02-20 18:29:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:20,432 INFO L470 AbstractCegarLoop]: Abstraction has 1047 states and 1518 transitions. [2022-02-20 18:29:20,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1518 transitions. [2022-02-20 18:29:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:29:20,433 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:20,433 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] [2022-02-20 18:29:20,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:29:20,433 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1105013027, now seen corresponding path program 1 times [2022-02-20 18:29:20,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:20,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056185391] [2022-02-20 18:29:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:20,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {18404#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {18404#true} is VALID [2022-02-20 18:29:20,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {18404#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {18404#true} is VALID [2022-02-20 18:29:20,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {18404#true} assume 0 == ~r1~0 % 256; {18404#true} is VALID [2022-02-20 18:29:20,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {18404#true} assume ~id1~0 >= 0; {18404#true} is VALID [2022-02-20 18:29:20,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {18404#true} assume 0 == ~st1~0; {18404#true} is VALID [2022-02-20 18:29:20,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {18404#true} assume ~send1~0 == ~id1~0; {18404#true} is VALID [2022-02-20 18:29:20,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {18404#true} assume 0 == ~mode1~0 % 256; {18404#true} is VALID [2022-02-20 18:29:20,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {18404#true} assume ~id2~0 >= 0; {18404#true} is VALID [2022-02-20 18:29:20,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {18404#true} assume 0 == ~st2~0; {18404#true} is VALID [2022-02-20 18:29:20,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {18404#true} assume ~send2~0 == ~id2~0; {18404#true} is VALID [2022-02-20 18:29:20,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {18404#true} assume 0 == ~mode2~0 % 256; {18404#true} is VALID [2022-02-20 18:29:20,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {18404#true} assume ~id3~0 >= 0; {18404#true} is VALID [2022-02-20 18:29:20,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {18404#true} assume 0 == ~st3~0; {18404#true} is VALID [2022-02-20 18:29:20,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {18404#true} assume ~send3~0 == ~id3~0; {18404#true} is VALID [2022-02-20 18:29:20,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {18404#true} assume 0 == ~mode3~0 % 256; {18404#true} is VALID [2022-02-20 18:29:20,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {18404#true} assume ~id4~0 >= 0; {18404#true} is VALID [2022-02-20 18:29:20,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {18404#true} assume 0 == ~st4~0; {18404#true} is VALID [2022-02-20 18:29:20,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {18404#true} assume ~send4~0 == ~id4~0; {18404#true} is VALID [2022-02-20 18:29:20,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {18404#true} assume 0 == ~mode4~0 % 256; {18404#true} is VALID [2022-02-20 18:29:20,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {18404#true} assume ~id1~0 != ~id2~0; {18404#true} is VALID [2022-02-20 18:29:20,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {18404#true} assume ~id1~0 != ~id3~0; {18404#true} is VALID [2022-02-20 18:29:20,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {18404#true} assume ~id1~0 != ~id4~0; {18404#true} is VALID [2022-02-20 18:29:20,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {18404#true} assume ~id2~0 != ~id3~0; {18404#true} is VALID [2022-02-20 18:29:20,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {18404#true} assume ~id2~0 != ~id4~0; {18404#true} is VALID [2022-02-20 18:29:20,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {18404#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {18406#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:29:20,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {18406#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {18407#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {18407#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {18408#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {18408#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {18404#true} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {18404#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;main_~i2~0#1 := 0; {18404#true} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {18404#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {18404#true} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {18404#true} assume !(0 != ~mode1~0 % 256); {18404#true} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {18404#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {18404#true} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {18404#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; {18404#true} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {18404#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; {18404#true} is VALID [2022-02-20 18:29:20,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {18404#true} assume !(0 != ~mode2~0 % 256); {18404#true} is VALID [2022-02-20 18:29:20,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {18404#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {18404#true} is VALID [2022-02-20 18:29:20,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {18404#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; {18404#true} is VALID [2022-02-20 18:29:20,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {18404#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; {18404#true} is VALID [2022-02-20 18:29:20,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {18404#true} assume !(0 != ~mode3~0 % 256); {18404#true} is VALID [2022-02-20 18:29:20,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {18404#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {18404#true} is VALID [2022-02-20 18:29:20,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {18404#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; {18404#true} is VALID [2022-02-20 18:29:20,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {18404#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; {18404#true} is VALID [2022-02-20 18:29:20,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {18404#true} assume !(0 != ~mode4~0 % 256); {18404#true} is VALID [2022-02-20 18:29:20,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {18404#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {18404#true} is VALID [2022-02-20 18:29:20,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {18404#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; {18404#true} is VALID [2022-02-20 18:29:20,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {18404#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {18404#true} is VALID [2022-02-20 18:29:20,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {18404#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {18404#true} is VALID [2022-02-20 18:29:20,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {18404#true} assume !(~r1~0 % 256 >= 4); {18404#true} is VALID [2022-02-20 18:29:20,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {18404#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {18404#true} is VALID [2022-02-20 18:29:20,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {18404#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {18409#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:29:20,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {18409#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {18410#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:29:20,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {18410#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {18411#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:29:20,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {18411#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {18405#false} is VALID [2022-02-20 18:29:20,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {18405#false} assume !false; {18405#false} is VALID [2022-02-20 18:29:20,582 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:20,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:20,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056185391] [2022-02-20 18:29:20,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056185391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:20,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:20,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:29:20,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901935549] [2022-02-20 18:29:20,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:20,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:29:20,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:20,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:20,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:20,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:29:20,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:29:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:20,616 INFO L87 Difference]: Start difference. First operand 1047 states and 1518 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:22,420 INFO L93 Difference]: Finished difference Result 1817 states and 2619 transitions. [2022-02-20 18:29:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:29:22,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:29:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-02-20 18:29:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-02-20 18:29:22,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 177 transitions. [2022-02-20 18:29:22,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:22,691 INFO L225 Difference]: With dead ends: 1817 [2022-02-20 18:29:22,691 INFO L226 Difference]: Without dead ends: 1815 [2022-02-20 18:29:22,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:29:22,692 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 498 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:22,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 506 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2022-02-20 18:29:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1095. [2022-02-20 18:29:23,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:23,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1815 states. Second operand has 1095 states, 1094 states have (on average 1.4241316270566728) internal successors, (1558), 1094 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call 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:23,471 INFO L74 IsIncluded]: Start isIncluded. First operand 1815 states. Second operand has 1095 states, 1094 states have (on average 1.4241316270566728) internal successors, (1558), 1094 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call 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:23,472 INFO L87 Difference]: Start difference. First operand 1815 states. Second operand has 1095 states, 1094 states have (on average 1.4241316270566728) internal successors, (1558), 1094 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call 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:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:23,587 INFO L93 Difference]: Finished difference Result 1815 states and 2594 transitions. [2022-02-20 18:29:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2594 transitions. [2022-02-20 18:29:23,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:23,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:23,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 1095 states, 1094 states have (on average 1.4241316270566728) internal successors, (1558), 1094 states have internal predecessors, (1558), 0 states have call successors, (0), 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 1815 states. [2022-02-20 18:29:23,593 INFO L87 Difference]: Start difference. First operand has 1095 states, 1094 states have (on average 1.4241316270566728) internal successors, (1558), 1094 states have internal predecessors, (1558), 0 states have call successors, (0), 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 1815 states. [2022-02-20 18:29:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:23,700 INFO L93 Difference]: Finished difference Result 1815 states and 2594 transitions. [2022-02-20 18:29:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2594 transitions. [2022-02-20 18:29:23,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:23,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:23,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:23,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.4241316270566728) internal successors, (1558), 1094 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call 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:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1558 transitions. [2022-02-20 18:29:23,767 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1558 transitions. Word has length 54 [2022-02-20 18:29:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:23,768 INFO L470 AbstractCegarLoop]: Abstraction has 1095 states and 1558 transitions. [2022-02-20 18:29:23,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1558 transitions. [2022-02-20 18:29:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:29:23,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:23,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:23,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:29:23,769 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1044582089, now seen corresponding path program 1 times [2022-02-20 18:29:23,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:23,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977417493] [2022-02-20 18:29:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:23,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {25612#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {25612#true} is VALID [2022-02-20 18:29:23,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {25612#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {25612#true} is VALID [2022-02-20 18:29:23,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {25612#true} assume 0 == ~r1~0 % 256; {25612#true} is VALID [2022-02-20 18:29:23,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {25612#true} assume ~id1~0 >= 0; {25612#true} is VALID [2022-02-20 18:29:23,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {25612#true} assume 0 == ~st1~0; {25612#true} is VALID [2022-02-20 18:29:23,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {25612#true} assume ~send1~0 == ~id1~0; {25612#true} is VALID [2022-02-20 18:29:23,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {25612#true} assume 0 == ~mode1~0 % 256; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {25614#(= (+ (* (- 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;main_~i2~0#1 := 0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:23,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {25614#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {25613#false} is VALID [2022-02-20 18:29:23,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {25613#false} assume !(255 == ~r1~0 % 256); {25613#false} is VALID [2022-02-20 18:29:23,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {25613#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {25613#false} is VALID [2022-02-20 18:29:23,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {25613#false} assume node1_~m1~0#1 != ~nomsg~0; {25613#false} is VALID [2022-02-20 18:29:23,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {25613#false} assume !(node1_~m1~0#1 > ~id1~0); {25613#false} is VALID [2022-02-20 18:29:23,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {25613#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {25613#false} is VALID [2022-02-20 18:29:23,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {25613#false} ~mode1~0 := 0; {25613#false} is VALID [2022-02-20 18:29:23,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {25613#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; {25613#false} is VALID [2022-02-20 18:29:23,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {25613#false} assume !(0 != ~mode2~0 % 256); {25613#false} is VALID [2022-02-20 18:29:23,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {25613#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {25613#false} is VALID [2022-02-20 18:29:23,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {25613#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {25613#false} is VALID [2022-02-20 18:29:23,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {25613#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; {25613#false} is VALID [2022-02-20 18:29:23,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {25613#false} assume !(0 != ~mode3~0 % 256); {25613#false} is VALID [2022-02-20 18:29:23,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {25613#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {25613#false} is VALID [2022-02-20 18:29:23,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {25613#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {25613#false} is VALID [2022-02-20 18:29:23,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {25613#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; {25613#false} is VALID [2022-02-20 18:29:23,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {25613#false} assume !(0 != ~mode4~0 % 256); {25613#false} is VALID [2022-02-20 18:29:23,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {25613#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {25613#false} is VALID [2022-02-20 18:29:23,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {25613#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {25613#false} is VALID [2022-02-20 18:29:23,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {25613#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25613#false} is VALID [2022-02-20 18:29:23,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {25613#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {25613#false} is VALID [2022-02-20 18:29:23,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {25613#false} check_#res#1 := check_~tmp~1#1; {25613#false} is VALID [2022-02-20 18:29:23,831 INFO L290 TraceCheckUtils]: 52: Hoare triple {25613#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {25613#false} is VALID [2022-02-20 18:29:23,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {25613#false} assume 0 == assert_~arg#1 % 256; {25613#false} is VALID [2022-02-20 18:29:23,831 INFO L290 TraceCheckUtils]: 54: Hoare triple {25613#false} assume !false; {25613#false} is VALID [2022-02-20 18:29:23,832 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:23,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:23,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977417493] [2022-02-20 18:29:23,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977417493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:23,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:23,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:23,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089056315] [2022-02-20 18:29:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:29:23,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:23,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:23,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:23,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:23,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:23,877 INFO L87 Difference]: Start difference. First operand 1095 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:25,252 INFO L93 Difference]: Finished difference Result 2190 states and 3148 transitions. [2022-02-20 18:29:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:25,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:29:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2022-02-20 18:29:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2022-02-20 18:29:25,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 232 transitions. [2022-02-20 18:29:25,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:25,498 INFO L225 Difference]: With dead ends: 2190 [2022-02-20 18:29:25,498 INFO L226 Difference]: Without dead ends: 1579 [2022-02-20 18:29:25,499 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:25,499 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 222 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:25,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 222 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:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-02-20 18:29:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1577. [2022-02-20 18:29:26,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:26,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1579 states. Second operand has 1577 states, 1576 states have (on average 1.416243654822335) internal successors, (2232), 1576 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call 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:26,486 INFO L74 IsIncluded]: Start isIncluded. First operand 1579 states. Second operand has 1577 states, 1576 states have (on average 1.416243654822335) internal successors, (2232), 1576 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call 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:26,487 INFO L87 Difference]: Start difference. First operand 1579 states. Second operand has 1577 states, 1576 states have (on average 1.416243654822335) internal successors, (2232), 1576 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call 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:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:26,557 INFO L93 Difference]: Finished difference Result 1579 states and 2233 transitions. [2022-02-20 18:29:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2233 transitions. [2022-02-20 18:29:26,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:26,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:26,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 1577 states, 1576 states have (on average 1.416243654822335) internal successors, (2232), 1576 states have internal predecessors, (2232), 0 states have call successors, (0), 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 1579 states. [2022-02-20 18:29:26,561 INFO L87 Difference]: Start difference. First operand has 1577 states, 1576 states have (on average 1.416243654822335) internal successors, (2232), 1576 states have internal predecessors, (2232), 0 states have call successors, (0), 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 1579 states. [2022-02-20 18:29:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:26,676 INFO L93 Difference]: Finished difference Result 1579 states and 2233 transitions. [2022-02-20 18:29:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2233 transitions. [2022-02-20 18:29:26,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:26,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:26,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:26,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 1.416243654822335) internal successors, (2232), 1576 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call 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:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2232 transitions. [2022-02-20 18:29:26,791 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2232 transitions. Word has length 55 [2022-02-20 18:29:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:26,791 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 2232 transitions. [2022-02-20 18:29:26,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2232 transitions. [2022-02-20 18:29:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:29:26,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:26,792 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:26,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:29:26,792 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:26,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1276698888, now seen corresponding path program 1 times [2022-02-20 18:29:26,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:26,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351489744] [2022-02-20 18:29:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:26,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {33394#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {33394#true} is VALID [2022-02-20 18:29:26,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {33394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {33394#true} is VALID [2022-02-20 18:29:26,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {33394#true} assume 0 == ~r1~0 % 256; {33394#true} is VALID [2022-02-20 18:29:26,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {33394#true} assume ~id1~0 >= 0; {33394#true} is VALID [2022-02-20 18:29:26,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {33394#true} assume 0 == ~st1~0; {33396#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:26,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {33396#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {33396#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:26,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {33396#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {33396#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:26,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {33396#(<= ~st1~0 0)} assume ~id2~0 >= 0; {33396#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:26,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {33396#(<= ~st1~0 0)} assume 0 == ~st2~0; {33397#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {33397#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {33397#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {33397#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {33397#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {33397#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {33397#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {33397#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {33398#(<= (+ ~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;main_~i2~0#1 := 0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 != ~nomsg~0); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {33398#(<= (+ ~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; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume node4_~m4~0#1 != ~nomsg~0; {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node4_~m4~0#1 > ~id4~0); {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:26,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {33398#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {33399#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:26,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {33399#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0; {33399#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:26,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {33399#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {33399#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:26,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {33399#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {33395#false} is VALID [2022-02-20 18:29:26,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {33395#false} check_#res#1 := check_~tmp~1#1; {33395#false} is VALID [2022-02-20 18:29:26,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {33395#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {33395#false} is VALID [2022-02-20 18:29:26,929 INFO L290 TraceCheckUtils]: 76: Hoare triple {33395#false} assume 0 == assert_~arg#1 % 256; {33395#false} is VALID [2022-02-20 18:29:26,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {33395#false} assume !false; {33395#false} is VALID [2022-02-20 18:29:26,929 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:29:26,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:26,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351489744] [2022-02-20 18:29:26,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351489744] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:26,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:26,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:26,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095816247] [2022-02-20 18:29:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:26,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:26,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:26,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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:26,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:26,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:26,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:26,989 INFO L87 Difference]: Start difference. First operand 1577 states and 2232 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:34,112 INFO L93 Difference]: Finished difference Result 8083 states and 11473 transitions. [2022-02-20 18:29:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:34,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2022-02-20 18:29:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2022-02-20 18:29:34,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 458 transitions. [2022-02-20 18:29:34,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:35,916 INFO L225 Difference]: With dead ends: 8083 [2022-02-20 18:29:35,916 INFO L226 Difference]: Without dead ends: 6537 [2022-02-20 18:29:35,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:29:35,919 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 471 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:35,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 482 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6537 states. [2022-02-20 18:29:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6537 to 3121. [2022-02-20 18:29:38,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:38,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6537 states. Second operand has 3121 states, 3120 states have (on average 1.412820512820513) internal successors, (4408), 3120 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call 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:38,141 INFO L74 IsIncluded]: Start isIncluded. First operand 6537 states. Second operand has 3121 states, 3120 states have (on average 1.412820512820513) internal successors, (4408), 3120 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call 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:38,144 INFO L87 Difference]: Start difference. First operand 6537 states. Second operand has 3121 states, 3120 states have (on average 1.412820512820513) internal successors, (4408), 3120 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call 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:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:39,437 INFO L93 Difference]: Finished difference Result 6537 states and 9248 transitions. [2022-02-20 18:29:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 9248 transitions. [2022-02-20 18:29:39,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:39,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:39,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 3121 states, 3120 states have (on average 1.412820512820513) internal successors, (4408), 3120 states have internal predecessors, (4408), 0 states have call successors, (0), 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 6537 states. [2022-02-20 18:29:39,450 INFO L87 Difference]: Start difference. First operand has 3121 states, 3120 states have (on average 1.412820512820513) internal successors, (4408), 3120 states have internal predecessors, (4408), 0 states have call successors, (0), 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 6537 states. [2022-02-20 18:29:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:40,668 INFO L93 Difference]: Finished difference Result 6537 states and 9248 transitions. [2022-02-20 18:29:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 9248 transitions. [2022-02-20 18:29:40,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:40,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:40,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:40,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3120 states have (on average 1.412820512820513) internal successors, (4408), 3120 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call 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,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4408 transitions. [2022-02-20 18:29:41,036 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4408 transitions. Word has length 78 [2022-02-20 18:29:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:41,036 INFO L470 AbstractCegarLoop]: Abstraction has 3121 states and 4408 transitions. [2022-02-20 18:29:41,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4408 transitions. [2022-02-20 18:29:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:29:41,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:41,037 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:41,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:29:41,038 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1827496306, now seen corresponding path program 1 times [2022-02-20 18:29:41,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:41,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625239260] [2022-02-20 18:29:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:41,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:41,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {60291#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {60291#true} is VALID [2022-02-20 18:29:41,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {60291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {60291#true} is VALID [2022-02-20 18:29:41,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {60291#true} assume 0 == ~r1~0 % 256; {60291#true} is VALID [2022-02-20 18:29:41,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {60291#true} assume ~id1~0 >= 0; {60291#true} is VALID [2022-02-20 18:29:41,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {60291#true} assume 0 == ~st1~0; {60293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {60293#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {60293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {60293#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {60293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {60293#(<= ~st1~0 0)} assume ~id2~0 >= 0; {60293#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:41,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {60293#(<= ~st1~0 0)} assume 0 == ~st2~0; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {60294#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {60294#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {60295#(<= (+ ~st4~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;main_~i2~0#1 := 0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,143 INFO L290 TraceCheckUtils]: 51: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {60295#(<= (+ ~st4~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; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:41,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {60295#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:41,151 INFO L290 TraceCheckUtils]: 67: Hoare triple {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:41,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~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; {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:41,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode4~0 % 256); {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:41,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:41,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~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; {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:41,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:41,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {60296#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {60292#false} is VALID [2022-02-20 18:29:41,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {60292#false} check_#res#1 := check_~tmp~1#1; {60292#false} is VALID [2022-02-20 18:29:41,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {60292#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {60292#false} is VALID [2022-02-20 18:29:41,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {60292#false} assume 0 == assert_~arg#1 % 256; {60292#false} is VALID [2022-02-20 18:29:41,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {60292#false} assume !false; {60292#false} is VALID [2022-02-20 18:29:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:29:41,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:41,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625239260] [2022-02-20 18:29:41,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625239260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:41,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:41,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:41,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826779283] [2022-02-20 18:29:41,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:41,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:41,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:41,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:41,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:41,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:41,216 INFO L87 Difference]: Start difference. First operand 3121 states and 4408 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:50,359 INFO L93 Difference]: Finished difference Result 9627 states and 13649 transitions. [2022-02-20 18:29:50,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:50,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2022-02-20 18:29:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2022-02-20 18:29:50,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 458 transitions. [2022-02-20 18:29:50,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:52,870 INFO L225 Difference]: With dead ends: 9627 [2022-02-20 18:29:52,870 INFO L226 Difference]: Without dead ends: 8081 [2022-02-20 18:29:52,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:29:52,873 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 419 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:52,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 540 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8081 states. [2022-02-20 18:29:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8081 to 5441. [2022-02-20 18:29:56,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:56,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8081 states. Second operand has 5441 states, 5440 states have (on average 1.4066176470588236) internal successors, (7652), 5440 states have internal predecessors, (7652), 0 states have call successors, (0), 0 states have call 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:56,943 INFO L74 IsIncluded]: Start isIncluded. First operand 8081 states. Second operand has 5441 states, 5440 states have (on average 1.4066176470588236) internal successors, (7652), 5440 states have internal predecessors, (7652), 0 states have call successors, (0), 0 states have call 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:56,945 INFO L87 Difference]: Start difference. First operand 8081 states. Second operand has 5441 states, 5440 states have (on average 1.4066176470588236) internal successors, (7652), 5440 states have internal predecessors, (7652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:58,763 INFO L93 Difference]: Finished difference Result 8081 states and 11424 transitions. [2022-02-20 18:29:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8081 states and 11424 transitions. [2022-02-20 18:29:58,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:58,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:58,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 5441 states, 5440 states have (on average 1.4066176470588236) internal successors, (7652), 5440 states have internal predecessors, (7652), 0 states have call successors, (0), 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 8081 states. [2022-02-20 18:29:58,778 INFO L87 Difference]: Start difference. First operand has 5441 states, 5440 states have (on average 1.4066176470588236) internal successors, (7652), 5440 states have internal predecessors, (7652), 0 states have call successors, (0), 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 8081 states. [2022-02-20 18:30:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:00,571 INFO L93 Difference]: Finished difference Result 8081 states and 11424 transitions. [2022-02-20 18:30:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8081 states and 11424 transitions. [2022-02-20 18:30:00,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:00,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:00,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:00,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5441 states, 5440 states have (on average 1.4066176470588236) internal successors, (7652), 5440 states have internal predecessors, (7652), 0 states have call successors, (0), 0 states have call 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,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5441 states to 5441 states and 7652 transitions. [2022-02-20 18:30:01,608 INFO L78 Accepts]: Start accepts. Automaton has 5441 states and 7652 transitions. Word has length 78 [2022-02-20 18:30:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:01,608 INFO L470 AbstractCegarLoop]: Abstraction has 5441 states and 7652 transitions. [2022-02-20 18:30:01,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5441 states and 7652 transitions. [2022-02-20 18:30:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:01,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:01,609 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:01,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:30:01,610 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash -695856466, now seen corresponding path program 1 times [2022-02-20 18:30:01,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:01,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309907621] [2022-02-20 18:30:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:01,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {95044#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {95044#true} is VALID [2022-02-20 18:30:01,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {95044#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {95044#true} is VALID [2022-02-20 18:30:01,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {95044#true} assume 0 == ~r1~0 % 256; {95044#true} is VALID [2022-02-20 18:30:01,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {95044#true} assume ~id1~0 >= 0; {95044#true} is VALID [2022-02-20 18:30:01,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {95044#true} assume 0 == ~st1~0; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {95046#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {95046#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {95046#(<= ~st1~0 0)} assume ~id2~0 >= 0; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {95046#(<= ~st1~0 0)} assume 0 == ~st2~0; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {95046#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {95046#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {95046#(<= ~st1~0 0)} assume ~id3~0 >= 0; {95046#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {95046#(<= ~st1~0 0)} assume 0 == ~st3~0; {95047#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {95047#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {95047#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {95047#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {95047#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {95047#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {95047#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {95047#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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;main_~i2~0#1 := 0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {95048#(<= (+ ~st4~0 ~st3~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; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {95048#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode2~0 := 0; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,718 INFO L290 TraceCheckUtils]: 64: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~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; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode3~0 := 0; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~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; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 != ~mode4~0 % 256); {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~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; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:01,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {95049#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {95045#false} is VALID [2022-02-20 18:30:01,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {95045#false} check_#res#1 := check_~tmp~1#1; {95045#false} is VALID [2022-02-20 18:30:01,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {95045#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {95045#false} is VALID [2022-02-20 18:30:01,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {95045#false} assume 0 == assert_~arg#1 % 256; {95045#false} is VALID [2022-02-20 18:30:01,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {95045#false} assume !false; {95045#false} is VALID [2022-02-20 18:30:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:30:01,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:01,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309907621] [2022-02-20 18:30:01,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309907621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:01,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:01,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:30:01,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281653430] [2022-02-20 18:30:01,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:01,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:01,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:01,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call 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,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:01,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:30:01,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:30:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:30:01,778 INFO L87 Difference]: Start difference. First operand 5441 states and 7652 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)