./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.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-var-start-time.4.1.ufo.BOUNDED-8.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 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:27:16,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:27:16,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:27:16,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:27:16,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:27:16,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:27:16,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:27:16,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:27:16,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:27:16,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:27:16,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:27:16,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:27:16,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:27:16,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:27:16,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:27:16,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:27:16,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:27:16,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:27:16,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:27:16,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:27:16,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:27:16,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:27:16,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:27:16,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:27:16,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:27:16,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:27:16,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:27:16,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:27:16,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:27:16,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:27:16,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:27:16,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:27:16,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:27:16,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:27:16,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:27:16,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:27:16,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:27:16,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:27:16,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:27:16,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:27:16,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:27:16,431 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:27:16,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:27:16,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:27:16,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:27:16,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:27:16,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:27:16,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:27:16,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:27:16,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:27:16,450 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:27:16,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:27:16,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:27:16,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:27:16,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:27:16,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:27:16,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:27:16,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:27:16,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:27:16,452 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:27:16,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:27:16,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:27:16,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:27:16,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:27:16,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:27:16,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:27:16,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:16,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:27:16,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:27:16,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:27:16,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:27:16,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:27:16,459 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:27:16,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:27:16,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:27:16,460 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 -> 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 [2022-02-20 18:27:16,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:27:16,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:27:16,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:27:16,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:27:16,643 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:27:16,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-02-20 18:27:16,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4eab813d/548ec6de44cb495fa71c0a264c5cebd0/FLAG03dbb9788 [2022-02-20 18:27:17,053 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:27:17,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-02-20 18:27:17,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4eab813d/548ec6de44cb495fa71c0a264c5cebd0/FLAG03dbb9788 [2022-02-20 18:27:17,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4eab813d/548ec6de44cb495fa71c0a264c5cebd0 [2022-02-20 18:27:17,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:27:17,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:27:17,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:17,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:27:17,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:27:17,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c10b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17, skipping insertion in model container [2022-02-20 18:27:17,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:27:17,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:27:17,678 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2022-02-20 18:27:17,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:17,687 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:27:17,733 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2022-02-20 18:27:17,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:17,746 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:27:17,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17 WrapperNode [2022-02-20 18:27:17,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:17,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:17,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:27:17,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:27:17,752 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:27:17" (1/1) ... [2022-02-20 18:27:17,768 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:27:17" (1/1) ... [2022-02-20 18:27:17,810 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 320 [2022-02-20 18:27:17,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:17,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:27:17,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:27:17,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:27:17,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:27:17,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:27:17,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:27:17,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:27:17,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (1/1) ... [2022-02-20 18:27:17,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:17,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:17,869 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:27:17,876 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:27:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:27:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:27:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:27:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:27:17,950 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:27:17,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:27:18,391 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:27:18,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:27:18,403 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:27:18,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:18 BoogieIcfgContainer [2022-02-20 18:27:18,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:27:18,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:27:18,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:27:18,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:27:18,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:27:17" (1/3) ... [2022-02-20 18:27:18,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3890cdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:18, skipping insertion in model container [2022-02-20 18:27:18,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:17" (2/3) ... [2022-02-20 18:27:18,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3890cdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:18, skipping insertion in model container [2022-02-20 18:27:18,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:18" (3/3) ... [2022-02-20 18:27:18,412 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-02-20 18:27:18,417 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:27:18,417 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:27:18,459 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:27:18,470 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:27:18,470 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:27:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 98 states have (on average 1.6938775510204083) internal successors, (166), 99 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:27:18,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:18,489 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:27:18,490 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2019613380, now seen corresponding path program 1 times [2022-02-20 18:27:18,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:18,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599541898] [2022-02-20 18:27:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:18,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {103#true} is VALID [2022-02-20 18:27:18,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {103#true} is VALID [2022-02-20 18:27:18,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {103#true} is VALID [2022-02-20 18:27:18,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {103#true} init_#res#1 := init_~tmp~0#1; {103#true} is VALID [2022-02-20 18:27:18,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#true} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {103#true} is VALID [2022-02-20 18:27:18,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {103#true} assume 0 == main_~i2~0#1;assume false; {104#false} is VALID [2022-02-20 18:27:18,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {104#false} ~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; {104#false} is VALID [2022-02-20 18:27:18,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {104#false} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {104#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {104#false} assume !(node1_~m1~0#1 != ~nomsg~0); {104#false} is VALID [2022-02-20 18:27:18,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {104#false} ~mode1~0 := 0; {104#false} is VALID [2022-02-20 18:27:18,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {104#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {104#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {104#false} assume !(node2_~m2~0#1 != ~nomsg~0); {104#false} is VALID [2022-02-20 18:27:18,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {104#false} ~mode2~0 := 0; {104#false} is VALID [2022-02-20 18:27:18,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {104#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {104#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {104#false} assume !(node3_~m3~0#1 != ~nomsg~0); {104#false} is VALID [2022-02-20 18:27:18,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {104#false} ~mode3~0 := 0; {104#false} is VALID [2022-02-20 18:27:18,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {104#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {104#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {104#false} is VALID [2022-02-20 18:27:18,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {104#false} assume !(node4_~m4~0#1 != ~nomsg~0); {104#false} is VALID [2022-02-20 18:27:18,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {104#false} ~mode4~0 := 0; {104#false} is VALID [2022-02-20 18:27:18,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {104#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; {104#false} is VALID [2022-02-20 18:27:18,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {104#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {104#false} is VALID [2022-02-20 18:27:18,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {104#false} check_#res#1 := check_~tmp~1#1; {104#false} is VALID [2022-02-20 18:27:18,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {104#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {104#false} is VALID [2022-02-20 18:27:18,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {104#false} assume 0 == assert_~arg#1 % 256; {104#false} is VALID [2022-02-20 18:27:18,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {104#false} assume !false; {104#false} is VALID [2022-02-20 18:27:18,633 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:27:18,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:18,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599541898] [2022-02-20 18:27:18,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599541898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:18,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:18,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:27:18,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84392158] [2022-02-20 18:27:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:18,640 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:27:18,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:18,643 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:27:18,669 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:27:18,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:27:18,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:18,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:27:18,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:18,697 INFO L87 Difference]: Start difference. First operand has 100 states, 98 states have (on average 1.6938775510204083) internal successors, (166), 99 states have internal predecessors, (166), 0 states have call successors, (0), 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:27:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:18,801 INFO L93 Difference]: Finished difference Result 171 states and 278 transitions. [2022-02-20 18:27:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:27:18,801 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:27:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:18,802 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:27:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 278 transitions. [2022-02-20 18:27:18,809 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:27:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 278 transitions. [2022-02-20 18:27:18,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 278 transitions. [2022-02-20 18:27:18,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:19,009 INFO L225 Difference]: With dead ends: 171 [2022-02-20 18:27:19,009 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 18:27:19,012 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:27:19,015 INFO L933 BasicCegarLoop]: 163 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, 163 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:27:19,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 18:27:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-20 18:27:19,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:19,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 95 states have (on average 1.6736842105263159) internal successors, (159), 95 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,050 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 95 states have (on average 1.6736842105263159) internal successors, (159), 95 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,050 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 95 states have (on average 1.6736842105263159) internal successors, (159), 95 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:19,059 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2022-02-20 18:27:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 159 transitions. [2022-02-20 18:27:19,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:19,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:19,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 95 states have (on average 1.6736842105263159) internal successors, (159), 95 states have internal predecessors, (159), 0 states have call successors, (0), 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 96 states. [2022-02-20 18:27:19,061 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 1.6736842105263159) internal successors, (159), 95 states have internal predecessors, (159), 0 states have call successors, (0), 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 96 states. [2022-02-20 18:27:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:19,067 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2022-02-20 18:27:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 159 transitions. [2022-02-20 18:27:19,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:19,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:19,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:19,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.6736842105263159) internal successors, (159), 95 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 159 transitions. [2022-02-20 18:27:19,078 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 159 transitions. Word has length 29 [2022-02-20 18:27:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:19,079 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 159 transitions. [2022-02-20 18:27:19,079 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:27:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 159 transitions. [2022-02-20 18:27:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:27:19,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:19,085 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:27:19,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:27:19,086 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2141340410, now seen corresponding path program 1 times [2022-02-20 18:27:19,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:19,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017489219] [2022-02-20 18:27:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:19,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {588#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {588#true} is VALID [2022-02-20 18:27:19,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {588#true} is VALID [2022-02-20 18:27:19,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {590#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:27:19,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {590#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {591#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:27:19,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {591#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {592#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:27:19,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {589#false} is VALID [2022-02-20 18:27:19,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#false} ~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; {589#false} is VALID [2022-02-20 18:27:19,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#false} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#false} assume !(node1_~m1~0#1 != ~nomsg~0); {589#false} is VALID [2022-02-20 18:27:19,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {589#false} ~mode1~0 := 0; {589#false} is VALID [2022-02-20 18:27:19,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume !(node2_~m2~0#1 != ~nomsg~0); {589#false} is VALID [2022-02-20 18:27:19,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} ~mode2~0 := 0; {589#false} is VALID [2022-02-20 18:27:19,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {589#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {589#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {589#false} assume !(node3_~m3~0#1 != ~nomsg~0); {589#false} is VALID [2022-02-20 18:27:19,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {589#false} ~mode3~0 := 0; {589#false} is VALID [2022-02-20 18:27:19,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {589#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {589#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {589#false} is VALID [2022-02-20 18:27:19,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {589#false} assume !(node4_~m4~0#1 != ~nomsg~0); {589#false} is VALID [2022-02-20 18:27:19,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {589#false} ~mode4~0 := 0; {589#false} is VALID [2022-02-20 18:27:19,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {589#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; {589#false} is VALID [2022-02-20 18:27:19,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {589#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {589#false} is VALID [2022-02-20 18:27:19,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {589#false} check_#res#1 := check_~tmp~1#1; {589#false} is VALID [2022-02-20 18:27:19,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {589#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {589#false} is VALID [2022-02-20 18:27:19,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {589#false} assume 0 == assert_~arg#1 % 256; {589#false} is VALID [2022-02-20 18:27:19,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-02-20 18:27:19,210 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:27:19,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:19,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017489219] [2022-02-20 18:27:19,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017489219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:19,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:19,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:19,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144706078] [2022-02-20 18:27:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:19,211 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:27:19,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:19,212 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:27:19,227 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:27:19,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:19,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:19,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:19,229 INFO L87 Difference]: Start difference. First operand 96 states and 159 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:27:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:19,526 INFO L93 Difference]: Finished difference Result 232 states and 373 transitions. [2022-02-20 18:27:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:19,526 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:27:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:19,526 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:27:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 373 transitions. [2022-02-20 18:27:19,531 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:27:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 373 transitions. [2022-02-20 18:27:19,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 373 transitions. [2022-02-20 18:27:19,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:19,750 INFO L225 Difference]: With dead ends: 232 [2022-02-20 18:27:19,750 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 18:27:19,751 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:27:19,752 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 107 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:19,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 591 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 18:27:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2022-02-20 18:27:19,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:19,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 96 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,757 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 96 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,757 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 96 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:19,761 INFO L93 Difference]: Finished difference Result 162 states and 240 transitions. [2022-02-20 18:27:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2022-02-20 18:27:19,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:19,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:19,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 0 states have call successors, (0), 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 162 states. [2022-02-20 18:27:19,762 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 0 states have call successors, (0), 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 162 states. [2022-02-20 18:27:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:19,766 INFO L93 Difference]: Finished difference Result 162 states and 240 transitions. [2022-02-20 18:27:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2022-02-20 18:27:19,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:19,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:19,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:19,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2022-02-20 18:27:19,769 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 29 [2022-02-20 18:27:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:19,769 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2022-02-20 18:27:19,769 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:27:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2022-02-20 18:27:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:27:19,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:19,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:19,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:27:19,770 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:19,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1164590349, now seen corresponding path program 1 times [2022-02-20 18:27:19,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:19,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653292282] [2022-02-20 18:27:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:19,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {1278#true} is VALID [2022-02-20 18:27:19,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1278#true} is VALID [2022-02-20 18:27:19,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} assume 0 == ~r1~0; {1278#true} is VALID [2022-02-20 18:27:19,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {1278#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1278#true} is VALID [2022-02-20 18:27:19,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {1278#true} assume ~id1~0 >= 0; {1278#true} is VALID [2022-02-20 18:27:19,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {1278#true} assume 0 == ~st1~0; {1278#true} is VALID [2022-02-20 18:27:19,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {1278#true} assume ~send1~0 == ~id1~0; {1278#true} is VALID [2022-02-20 18:27:19,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1278#true} assume 0 == ~mode1~0 % 256; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:19,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {1280#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1279#false} is VALID [2022-02-20 18:27:19,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {1279#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1279#false} is VALID [2022-02-20 18:27:19,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {1279#false} ~mode1~0 := 0; {1279#false} is VALID [2022-02-20 18:27:19,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {1279#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1279#false} is VALID [2022-02-20 18:27:19,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {1279#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1279#false} is VALID [2022-02-20 18:27:19,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {1279#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1279#false} is VALID [2022-02-20 18:27:19,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {1279#false} ~mode2~0 := 0; {1279#false} is VALID [2022-02-20 18:27:19,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {1279#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1279#false} is VALID [2022-02-20 18:27:19,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {1279#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1279#false} is VALID [2022-02-20 18:27:19,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {1279#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1279#false} is VALID [2022-02-20 18:27:19,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {1279#false} ~mode3~0 := 0; {1279#false} is VALID [2022-02-20 18:27:19,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {1279#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1279#false} is VALID [2022-02-20 18:27:19,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {1279#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1279#false} is VALID [2022-02-20 18:27:19,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {1279#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1279#false} is VALID [2022-02-20 18:27:19,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {1279#false} ~mode4~0 := 0; {1279#false} is VALID [2022-02-20 18:27:19,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {1279#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; {1279#false} is VALID [2022-02-20 18:27:19,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {1279#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1279#false} is VALID [2022-02-20 18:27:19,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {1279#false} check_#res#1 := check_~tmp~1#1; {1279#false} is VALID [2022-02-20 18:27:19,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {1279#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {1279#false} is VALID [2022-02-20 18:27:19,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {1279#false} assume 0 == assert_~arg#1 % 256; {1279#false} is VALID [2022-02-20 18:27:19,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2022-02-20 18:27:19,894 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:27:19,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:19,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653292282] [2022-02-20 18:27:19,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653292282] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:19,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:19,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:19,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190176316] [2022-02-20 18:27:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:19,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:27:19,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:19,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:19,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:19,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:19,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:19,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:19,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:19,925 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:20,074 INFO L93 Difference]: Finished difference Result 216 states and 325 transitions. [2022-02-20 18:27:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:20,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:27:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:20,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 325 transitions. [2022-02-20 18:27:20,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:20,270 INFO L225 Difference]: With dead ends: 216 [2022-02-20 18:27:20,270 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 18:27:20,270 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:27:20,271 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 93 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 312 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:27:20,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 18:27:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2022-02-20 18:27:20,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:20,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,277 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,277 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:20,280 INFO L93 Difference]: Finished difference Result 150 states and 219 transitions. [2022-02-20 18:27:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2022-02-20 18:27:20,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:20,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:20,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 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 150 states. [2022-02-20 18:27:20,281 INFO L87 Difference]: Start difference. First operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 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 150 states. [2022-02-20 18:27:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:20,284 INFO L93 Difference]: Finished difference Result 150 states and 219 transitions. [2022-02-20 18:27:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2022-02-20 18:27:20,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:20,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:20,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:20,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4829931972789117) internal successors, (218), 147 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2022-02-20 18:27:20,288 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 52 [2022-02-20 18:27:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:20,289 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2022-02-20 18:27:20,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2022-02-20 18:27:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:27:20,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:20,290 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:27:20,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:27:20,296 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:20,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash 502679627, now seen corresponding path program 1 times [2022-02-20 18:27:20,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:20,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202477718] [2022-02-20 18:27:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:20,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {1979#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {1979#true} is VALID [2022-02-20 18:27:20,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {1979#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1979#true} is VALID [2022-02-20 18:27:20,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {1979#true} assume 0 == ~r1~0; {1979#true} is VALID [2022-02-20 18:27:20,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {1979#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1979#true} is VALID [2022-02-20 18:27:20,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {1979#true} assume ~id1~0 >= 0; {1979#true} is VALID [2022-02-20 18:27:20,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {1979#true} assume 0 == ~st1~0; {1979#true} is VALID [2022-02-20 18:27:20,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {1979#true} assume ~send1~0 == ~id1~0; {1979#true} is VALID [2022-02-20 18:27:20,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {1979#true} assume 0 == ~mode1~0 % 256; {1979#true} is VALID [2022-02-20 18:27:20,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {1979#true} assume ~id2~0 >= 0; {1979#true} is VALID [2022-02-20 18:27:20,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {1979#true} assume 0 == ~st2~0; {1979#true} is VALID [2022-02-20 18:27:20,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {1979#true} assume ~send2~0 == ~id2~0; {1979#true} is VALID [2022-02-20 18:27:20,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {1979#true} assume 0 == ~mode2~0 % 256; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1981#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:20,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {1981#(= (+ (* (- 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; {1980#false} is VALID [2022-02-20 18:27:20,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {1980#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1980#false} is VALID [2022-02-20 18:27:20,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {1980#false} ~mode2~0 := 0; {1980#false} is VALID [2022-02-20 18:27:20,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {1980#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1980#false} is VALID [2022-02-20 18:27:20,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {1980#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1980#false} is VALID [2022-02-20 18:27:20,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {1980#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1980#false} is VALID [2022-02-20 18:27:20,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {1980#false} ~mode3~0 := 0; {1980#false} is VALID [2022-02-20 18:27:20,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {1980#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1980#false} is VALID [2022-02-20 18:27:20,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {1980#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1980#false} is VALID [2022-02-20 18:27:20,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {1980#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1980#false} is VALID [2022-02-20 18:27:20,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {1980#false} ~mode4~0 := 0; {1980#false} is VALID [2022-02-20 18:27:20,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {1980#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; {1980#false} is VALID [2022-02-20 18:27:20,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {1980#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1980#false} is VALID [2022-02-20 18:27:20,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {1980#false} check_#res#1 := check_~tmp~1#1; {1980#false} is VALID [2022-02-20 18:27:20,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {1980#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {1980#false} is VALID [2022-02-20 18:27:20,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {1980#false} assume 0 == assert_~arg#1 % 256; {1980#false} is VALID [2022-02-20 18:27:20,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {1980#false} assume !false; {1980#false} is VALID [2022-02-20 18:27:20,368 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:27:20,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:20,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202477718] [2022-02-20 18:27:20,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202477718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:20,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:20,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:20,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491893195] [2022-02-20 18:27:20,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:20,369 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:27:20,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:20,369 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:27:20,403 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:27:20,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:20,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:20,404 INFO L87 Difference]: Start difference. First operand 148 states and 218 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:27:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:20,564 INFO L93 Difference]: Finished difference Result 360 states and 554 transitions. [2022-02-20 18:27:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:20,564 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:27:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:20,564 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:27:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:20,566 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:27:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:20,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 325 transitions. [2022-02-20 18:27:20,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:20,759 INFO L225 Difference]: With dead ends: 360 [2022-02-20 18:27:20,760 INFO L226 Difference]: Without dead ends: 242 [2022-02-20 18:27:20,760 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:27:20,761 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 88 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 303 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:27:20,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 303 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-02-20 18:27:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2022-02-20 18:27:20,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:20,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 240 states, 239 states have (on average 1.5188284518828452) internal successors, (363), 239 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,769 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 240 states, 239 states have (on average 1.5188284518828452) internal successors, (363), 239 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,769 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 240 states, 239 states have (on average 1.5188284518828452) internal successors, (363), 239 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:20,774 INFO L93 Difference]: Finished difference Result 242 states and 364 transitions. [2022-02-20 18:27:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 364 transitions. [2022-02-20 18:27:20,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:20,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:20,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 239 states have (on average 1.5188284518828452) internal successors, (363), 239 states have internal predecessors, (363), 0 states have call successors, (0), 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 242 states. [2022-02-20 18:27:20,776 INFO L87 Difference]: Start difference. First operand has 240 states, 239 states have (on average 1.5188284518828452) internal successors, (363), 239 states have internal predecessors, (363), 0 states have call successors, (0), 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 242 states. [2022-02-20 18:27:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:20,781 INFO L93 Difference]: Finished difference Result 242 states and 364 transitions. [2022-02-20 18:27:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 364 transitions. [2022-02-20 18:27:20,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:20,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:20,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:20,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.5188284518828452) internal successors, (363), 239 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 363 transitions. [2022-02-20 18:27:20,786 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 363 transitions. Word has length 53 [2022-02-20 18:27:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:20,787 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 363 transitions. [2022-02-20 18:27:20,787 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:27:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 363 transitions. [2022-02-20 18:27:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:27:20,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:20,788 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:27:20,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:27:20,788 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1405286019, now seen corresponding path program 1 times [2022-02-20 18:27:20,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:20,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966775400] [2022-02-20 18:27:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:20,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {3130#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {3130#true} is VALID [2022-02-20 18:27:20,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3130#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3130#true} is VALID [2022-02-20 18:27:20,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {3130#true} assume 0 == ~r1~0; {3130#true} is VALID [2022-02-20 18:27:20,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {3130#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {3130#true} is VALID [2022-02-20 18:27:20,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {3130#true} assume ~id1~0 >= 0; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {3130#true} assume 0 == ~st1~0; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {3130#true} assume ~send1~0 == ~id1~0; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {3130#true} assume 0 == ~mode1~0 % 256; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {3130#true} assume ~id2~0 >= 0; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {3130#true} assume 0 == ~st2~0; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {3130#true} assume ~send2~0 == ~id2~0; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {3130#true} assume 0 == ~mode2~0 % 256; {3130#true} is VALID [2022-02-20 18:27:20,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {3130#true} assume ~id3~0 >= 0; {3130#true} is VALID [2022-02-20 18:27:20,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#true} assume 0 == ~st3~0; {3130#true} is VALID [2022-02-20 18:27:20,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#true} assume ~send3~0 == ~id3~0; {3130#true} is VALID [2022-02-20 18:27:20,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#true} assume 0 == ~mode3~0 % 256; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:20,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {3132#(= (+ (* (- 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; {3131#false} is VALID [2022-02-20 18:27:20,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {3131#false} assume !(node3_~m3~0#1 != ~nomsg~0); {3131#false} is VALID [2022-02-20 18:27:20,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {3131#false} ~mode3~0 := 0; {3131#false} is VALID [2022-02-20 18:27:20,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {3131#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3131#false} is VALID [2022-02-20 18:27:20,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {3131#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {3131#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {3131#false} ~mode4~0 := 0; {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {3131#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; {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {3131#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {3131#false} check_#res#1 := check_~tmp~1#1; {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {3131#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {3131#false} assume 0 == assert_~arg#1 % 256; {3131#false} is VALID [2022-02-20 18:27:20,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {3131#false} assume !false; {3131#false} is VALID [2022-02-20 18:27:20,884 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:27:20,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:20,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966775400] [2022-02-20 18:27:20,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966775400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:20,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:20,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:20,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194761613] [2022-02-20 18:27:20,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:20,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:20,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:20,916 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:27:20,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:20,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:20,917 INFO L87 Difference]: Start difference. First operand 240 states and 363 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,073 INFO L93 Difference]: Finished difference Result 612 states and 949 transitions. [2022-02-20 18:27:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:21,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 325 transitions. [2022-02-20 18:27:21,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:21,297 INFO L225 Difference]: With dead ends: 612 [2022-02-20 18:27:21,297 INFO L226 Difference]: Without dead ends: 402 [2022-02-20 18:27:21,298 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:27:21,298 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 83 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 294 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:27:21,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 294 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-02-20 18:27:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2022-02-20 18:27:21,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:21,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.531328320802005) internal successors, (611), 399 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,312 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.531328320802005) internal successors, (611), 399 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,313 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.531328320802005) internal successors, (611), 399 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,322 INFO L93 Difference]: Finished difference Result 402 states and 612 transitions. [2022-02-20 18:27:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 612 transitions. [2022-02-20 18:27:21,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:21,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:21,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 399 states have (on average 1.531328320802005) internal successors, (611), 399 states have internal predecessors, (611), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:27:21,324 INFO L87 Difference]: Start difference. First operand has 400 states, 399 states have (on average 1.531328320802005) internal successors, (611), 399 states have internal predecessors, (611), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:27:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,331 INFO L93 Difference]: Finished difference Result 402 states and 612 transitions. [2022-02-20 18:27:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 612 transitions. [2022-02-20 18:27:21,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:21,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:21,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:21,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.531328320802005) internal successors, (611), 399 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 611 transitions. [2022-02-20 18:27:21,351 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 611 transitions. Word has length 54 [2022-02-20 18:27:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:21,351 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 611 transitions. [2022-02-20 18:27:21,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 611 transitions. [2022-02-20 18:27:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:27:21,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:21,352 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:27:21,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:21,352 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash 417554395, now seen corresponding path program 1 times [2022-02-20 18:27:21,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:21,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120985251] [2022-02-20 18:27:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:21,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {5073#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {5073#true} is VALID [2022-02-20 18:27:21,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {5073#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5073#true} is VALID [2022-02-20 18:27:21,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {5073#true} assume 0 == ~r1~0; {5073#true} is VALID [2022-02-20 18:27:21,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {5073#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {5073#true} is VALID [2022-02-20 18:27:21,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {5073#true} assume ~id1~0 >= 0; {5073#true} is VALID [2022-02-20 18:27:21,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {5073#true} assume 0 == ~st1~0; {5073#true} is VALID [2022-02-20 18:27:21,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {5073#true} assume ~send1~0 == ~id1~0; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {5073#true} assume 0 == ~mode1~0 % 256; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {5073#true} assume ~id2~0 >= 0; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {5073#true} assume 0 == ~st2~0; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {5073#true} assume ~send2~0 == ~id2~0; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {5073#true} assume 0 == ~mode2~0 % 256; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {5073#true} assume ~id3~0 >= 0; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {5073#true} assume 0 == ~st3~0; {5073#true} is VALID [2022-02-20 18:27:21,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {5073#true} assume ~send3~0 == ~id3~0; {5073#true} is VALID [2022-02-20 18:27:21,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {5073#true} assume 0 == ~mode3~0 % 256; {5073#true} is VALID [2022-02-20 18:27:21,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {5073#true} assume ~id4~0 >= 0; {5073#true} is VALID [2022-02-20 18:27:21,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {5073#true} assume 0 == ~st4~0; {5073#true} is VALID [2022-02-20 18:27:21,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {5073#true} assume ~send4~0 == ~id4~0; {5073#true} is VALID [2022-02-20 18:27:21,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {5073#true} assume 0 == ~mode4~0 % 256; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == main_~i2~0#1); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~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; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5075#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {5075#(= (+ (* (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; {5074#false} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {5074#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5074#false} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {5074#false} ~mode4~0 := 0; {5074#false} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {5074#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; {5074#false} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {5074#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5074#false} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {5074#false} check_#res#1 := check_~tmp~1#1; {5074#false} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {5074#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {5074#false} is VALID [2022-02-20 18:27:21,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {5074#false} assume 0 == assert_~arg#1 % 256; {5074#false} is VALID [2022-02-20 18:27:21,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {5074#false} assume !false; {5074#false} is VALID [2022-02-20 18:27:21,412 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:27:21,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:21,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120985251] [2022-02-20 18:27:21,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120985251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:21,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:21,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:21,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941806207] [2022-02-20 18:27:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:21,413 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:27:21,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:21,413 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:27:21,442 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:27:21,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:21,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:21,443 INFO L87 Difference]: Start difference. First operand 400 states and 611 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:27:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,617 INFO L93 Difference]: Finished difference Result 1044 states and 1613 transitions. [2022-02-20 18:27:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:21,617 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:27:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:21,617 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:27:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:21,619 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:27:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 18:27:21,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 325 transitions. [2022-02-20 18:27:21,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:21,834 INFO L225 Difference]: With dead ends: 1044 [2022-02-20 18:27:21,834 INFO L226 Difference]: Without dead ends: 674 [2022-02-20 18:27:21,835 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:27:21,835 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 78 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 285 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:27:21,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 285 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-02-20 18:27:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 672. [2022-02-20 18:27:21,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:21,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 672 states, 671 states have (on average 1.5245901639344261) internal successors, (1023), 671 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,858 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 672 states, 671 states have (on average 1.5245901639344261) internal successors, (1023), 671 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,859 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 672 states, 671 states have (on average 1.5245901639344261) internal successors, (1023), 671 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,874 INFO L93 Difference]: Finished difference Result 674 states and 1024 transitions. [2022-02-20 18:27:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1024 transitions. [2022-02-20 18:27:21,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:21,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:21,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 672 states, 671 states have (on average 1.5245901639344261) internal successors, (1023), 671 states have internal predecessors, (1023), 0 states have call successors, (0), 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 674 states. [2022-02-20 18:27:21,877 INFO L87 Difference]: Start difference. First operand has 672 states, 671 states have (on average 1.5245901639344261) internal successors, (1023), 671 states have internal predecessors, (1023), 0 states have call successors, (0), 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 674 states. [2022-02-20 18:27:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:21,892 INFO L93 Difference]: Finished difference Result 674 states and 1024 transitions. [2022-02-20 18:27:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1024 transitions. [2022-02-20 18:27:21,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:21,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:21,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:21,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.5245901639344261) internal successors, (1023), 671 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1023 transitions. [2022-02-20 18:27:21,910 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1023 transitions. Word has length 55 [2022-02-20 18:27:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:21,910 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1023 transitions. [2022-02-20 18:27:21,910 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:27:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1023 transitions. [2022-02-20 18:27:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:27:21,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:21,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:21,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:21,911 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:21,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash -368690669, now seen corresponding path program 1 times [2022-02-20 18:27:21,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:21,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50533294] [2022-02-20 18:27:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:21,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {8384#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {8384#true} is VALID [2022-02-20 18:27:21,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {8384#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8384#true} is VALID [2022-02-20 18:27:21,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {8384#true} assume 0 == ~r1~0; {8384#true} is VALID [2022-02-20 18:27:21,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {8384#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {8384#true} is VALID [2022-02-20 18:27:21,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {8384#true} assume ~id1~0 >= 0; {8384#true} is VALID [2022-02-20 18:27:21,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {8384#true} assume 0 == ~st1~0; {8386#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {8386#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {8386#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {8386#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {8386#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {8386#(<= ~st1~0 0)} assume ~id2~0 >= 0; {8386#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:21,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {8386#(<= ~st1~0 0)} assume 0 == ~st2~0; {8387#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {8387#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {8387#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {8387#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {8387#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {8387#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {8387#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {8387#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {8388#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive4~0 % 256); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {8389#(<= (+ ~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; {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:21,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {8389#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {8385#false} is VALID [2022-02-20 18:27:21,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {8385#false} check_#res#1 := check_~tmp~1#1; {8385#false} is VALID [2022-02-20 18:27:21,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {8385#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {8385#false} is VALID [2022-02-20 18:27:21,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {8385#false} assume 0 == assert_~arg#1 % 256; {8385#false} is VALID [2022-02-20 18:27:21,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {8385#false} assume !false; {8385#false} is VALID [2022-02-20 18:27:21,981 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:27:21,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:21,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50533294] [2022-02-20 18:27:21,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50533294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:21,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:21,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:21,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928865672] [2022-02-20 18:27:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:21,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:27:21,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:21,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:22,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:22,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:22,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:22,014 INFO L87 Difference]: Start difference. First operand 672 states and 1023 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:23,587 INFO L93 Difference]: Finished difference Result 3882 states and 5988 transitions. [2022-02-20 18:27:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:23,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:27:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions. [2022-02-20 18:27:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions. [2022-02-20 18:27:23,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 660 transitions. [2022-02-20 18:27:23,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:24,350 INFO L225 Difference]: With dead ends: 3882 [2022-02-20 18:27:24,350 INFO L226 Difference]: Without dead ends: 3240 [2022-02-20 18:27:24,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:27:24,352 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 839 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:24,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 1028 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2022-02-20 18:27:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 1312. [2022-02-20 18:27:24,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:24,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3240 states. Second operand has 1312 states, 1311 states have (on average 1.5125858123569793) internal successors, (1983), 1311 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,675 INFO L74 IsIncluded]: Start isIncluded. First operand 3240 states. Second operand has 1312 states, 1311 states have (on average 1.5125858123569793) internal successors, (1983), 1311 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,677 INFO L87 Difference]: Start difference. First operand 3240 states. Second operand has 1312 states, 1311 states have (on average 1.5125858123569793) internal successors, (1983), 1311 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:24,984 INFO L93 Difference]: Finished difference Result 3240 states and 4963 transitions. [2022-02-20 18:27:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4963 transitions. [2022-02-20 18:27:24,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:24,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:24,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 1312 states, 1311 states have (on average 1.5125858123569793) internal successors, (1983), 1311 states have internal predecessors, (1983), 0 states have call successors, (0), 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 3240 states. [2022-02-20 18:27:24,992 INFO L87 Difference]: Start difference. First operand has 1312 states, 1311 states have (on average 1.5125858123569793) internal successors, (1983), 1311 states have internal predecessors, (1983), 0 states have call successors, (0), 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 3240 states. [2022-02-20 18:27:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:25,290 INFO L93 Difference]: Finished difference Result 3240 states and 4963 transitions. [2022-02-20 18:27:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4963 transitions. [2022-02-20 18:27:25,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:25,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:25,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:25,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 1.5125858123569793) internal successors, (1983), 1311 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1983 transitions. [2022-02-20 18:27:25,347 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1983 transitions. Word has length 56 [2022-02-20 18:27:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:25,348 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 1983 transitions. [2022-02-20 18:27:25,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1983 transitions. [2022-02-20 18:27:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:27:25,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:25,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:25,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:25,349 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1072167829, now seen corresponding path program 1 times [2022-02-20 18:27:25,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:25,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514222251] [2022-02-20 18:27:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:25,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {20843#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {20843#true} is VALID [2022-02-20 18:27:25,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {20843#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20843#true} is VALID [2022-02-20 18:27:25,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {20843#true} assume 0 == ~r1~0; {20843#true} is VALID [2022-02-20 18:27:25,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {20843#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == main_~i2~0#1); {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} ~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; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:25,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {20845#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:25,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:25,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:25,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:25,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:25,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {20846#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:25,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:25,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:25,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:25,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~mode3~0 % 256); {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:25,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {20847#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~alive3~0 % 256); {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:25,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:25,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1; {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:25,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:25,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~mode4~0 % 256); {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:25,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {20848#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~alive4~0 % 256); {20844#false} is VALID [2022-02-20 18:27:25,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {20844#false} assume !(~send4~0 != ~id4~0); {20844#false} is VALID [2022-02-20 18:27:25,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {20844#false} ~mode4~0 := 1; {20844#false} is VALID [2022-02-20 18:27:25,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {20844#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; {20844#false} is VALID [2022-02-20 18:27:25,456 INFO L290 TraceCheckUtils]: 51: Hoare triple {20844#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {20844#false} is VALID [2022-02-20 18:27:25,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {20844#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {20844#false} is VALID [2022-02-20 18:27:25,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {20844#false} check_#res#1 := check_~tmp~1#1; {20844#false} is VALID [2022-02-20 18:27:25,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {20844#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {20844#false} is VALID [2022-02-20 18:27:25,457 INFO L290 TraceCheckUtils]: 55: Hoare triple {20844#false} assume 0 == assert_~arg#1 % 256; {20844#false} is VALID [2022-02-20 18:27:25,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {20844#false} assume !false; {20844#false} is VALID [2022-02-20 18:27:25,457 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:27:25,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:25,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514222251] [2022-02-20 18:27:25,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514222251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:25,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:25,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:25,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416773859] [2022-02-20 18:27:25,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:25,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:27:25,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:25,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:25,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:25,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:25,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:25,501 INFO L87 Difference]: Start difference. First operand 1312 states and 1983 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:28,523 INFO L93 Difference]: Finished difference Result 5864 states and 8803 transitions. [2022-02-20 18:27:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:27:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2022-02-20 18:27:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2022-02-20 18:27:28,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 493 transitions. [2022-02-20 18:27:28,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:29,587 INFO L225 Difference]: With dead ends: 5864 [2022-02-20 18:27:29,587 INFO L226 Difference]: Without dead ends: 4582 [2022-02-20 18:27:29,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:29,589 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 582 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:29,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 456 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2022-02-20 18:27:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4576. [2022-02-20 18:27:31,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:31,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4582 states. Second operand has 4576 states, 4575 states have (on average 1.4896174863387979) internal successors, (6815), 4575 states have internal predecessors, (6815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:31,219 INFO L74 IsIncluded]: Start isIncluded. First operand 4582 states. Second operand has 4576 states, 4575 states have (on average 1.4896174863387979) internal successors, (6815), 4575 states have internal predecessors, (6815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:31,228 INFO L87 Difference]: Start difference. First operand 4582 states. Second operand has 4576 states, 4575 states have (on average 1.4896174863387979) internal successors, (6815), 4575 states have internal predecessors, (6815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:31,776 INFO L93 Difference]: Finished difference Result 4582 states and 6818 transitions. [2022-02-20 18:27:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 6818 transitions. [2022-02-20 18:27:31,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:31,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:31,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 4576 states, 4575 states have (on average 1.4896174863387979) internal successors, (6815), 4575 states have internal predecessors, (6815), 0 states have call successors, (0), 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 4582 states. [2022-02-20 18:27:31,787 INFO L87 Difference]: Start difference. First operand has 4576 states, 4575 states have (on average 1.4896174863387979) internal successors, (6815), 4575 states have internal predecessors, (6815), 0 states have call successors, (0), 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 4582 states. [2022-02-20 18:27:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,346 INFO L93 Difference]: Finished difference Result 4582 states and 6818 transitions. [2022-02-20 18:27:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 6818 transitions. [2022-02-20 18:27:32,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:32,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 4575 states have (on average 1.4896174863387979) internal successors, (6815), 4575 states have internal predecessors, (6815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 6815 transitions. [2022-02-20 18:27:33,000 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 6815 transitions. Word has length 57 [2022-02-20 18:27:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:33,000 INFO L470 AbstractCegarLoop]: Abstraction has 4576 states and 6815 transitions. [2022-02-20 18:27:33,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 6815 transitions. [2022-02-20 18:27:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:27:33,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:33,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:33,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:27:33,002 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1541080392, now seen corresponding path program 1 times [2022-02-20 18:27:33,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:33,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799665842] [2022-02-20 18:27:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:33,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:33,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {42185#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {42185#true} is VALID [2022-02-20 18:27:33,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {42185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {42185#true} is VALID [2022-02-20 18:27:33,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {42185#true} assume 0 == ~r1~0; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {42185#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {42185#true} assume ~id1~0 >= 0; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {42185#true} assume 0 == ~st1~0; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {42185#true} assume ~send1~0 == ~id1~0; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {42185#true} assume 0 == ~mode1~0 % 256; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {42185#true} assume ~id2~0 >= 0; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {42185#true} assume 0 == ~st2~0; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {42185#true} assume ~send2~0 == ~id2~0; {42185#true} is VALID [2022-02-20 18:27:33,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {42185#true} assume 0 == ~mode2~0 % 256; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {42185#true} assume ~id3~0 >= 0; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {42185#true} assume 0 == ~st3~0; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {42185#true} assume ~send3~0 == ~id3~0; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {42185#true} assume 0 == ~mode3~0 % 256; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {42185#true} assume ~id4~0 >= 0; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {42185#true} assume 0 == ~st4~0; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {42185#true} assume ~send4~0 == ~id4~0; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {42185#true} assume 0 == ~mode4~0 % 256; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {42185#true} assume ~id1~0 != ~id2~0; {42185#true} is VALID [2022-02-20 18:27:33,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {42185#true} assume ~id1~0 != ~id3~0; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {42185#true} assume ~id1~0 != ~id4~0; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {42185#true} assume ~id2~0 != ~id3~0; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {42185#true} assume ~id2~0 != ~id4~0; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {42185#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {42185#true} init_#res#1 := init_~tmp~0#1; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {42185#true} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {42185#true} assume !(0 == main_~i2~0#1); {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {42185#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; {42185#true} is VALID [2022-02-20 18:27:33,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {42185#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {42185#true} assume !(0 != ~mode1~0 % 256); {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {42185#true} assume 0 != ~alive1~0 % 256; {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {42185#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {42185#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; {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {42185#true} ~mode1~0 := 1; {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {42185#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {42185#true} assume !(0 != ~mode2~0 % 256); {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {42185#true} assume !(0 != ~alive2~0 % 256); {42185#true} is VALID [2022-02-20 18:27:33,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {42185#true} assume !(~send2~0 != ~id2~0); {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {42185#true} ~mode2~0 := 1; {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {42185#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {42185#true} assume !(0 != ~mode3~0 % 256); {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {42185#true} assume !(0 != ~alive3~0 % 256); {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {42185#true} assume !(~send3~0 != ~id3~0); {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {42185#true} ~mode3~0 := 1; {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {42185#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {42185#true} assume !(0 != ~mode4~0 % 256); {42185#true} is VALID [2022-02-20 18:27:33,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {42185#true} assume !(0 != ~alive4~0 % 256); {42185#true} is VALID [2022-02-20 18:27:33,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {42185#true} assume !(~send4~0 != ~id4~0); {42185#true} is VALID [2022-02-20 18:27:33,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {42185#true} ~mode4~0 := 1; {42185#true} is VALID [2022-02-20 18:27:33,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {42185#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; {42185#true} is VALID [2022-02-20 18:27:33,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {42185#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {42185#true} is VALID [2022-02-20 18:27:33,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {42185#true} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {42187#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID [2022-02-20 18:27:33,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {42187#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {42188#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID [2022-02-20 18:27:33,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {42188#(= 1 |ULTIMATE.start_check_#res#1|)} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {42189#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:27:33,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {42189#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {42186#false} is VALID [2022-02-20 18:27:33,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {42186#false} assume !false; {42186#false} is VALID [2022-02-20 18:27:33,095 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:27:33,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:33,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799665842] [2022-02-20 18:27:33,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799665842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:33,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:33,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:33,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287808276] [2022-02-20 18:27:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:33,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:27:33,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:33,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:33,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:33,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:33,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:33,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:33,127 INFO L87 Difference]: Start difference. First operand 4576 states and 6815 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:40,432 INFO L93 Difference]: Finished difference Result 9634 states and 14112 transitions. [2022-02-20 18:27:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:27:40,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:27:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2022-02-20 18:27:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2022-02-20 18:27:40,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 244 transitions. [2022-02-20 18:27:40,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:43,856 INFO L225 Difference]: With dead ends: 9634 [2022-02-20 18:27:43,856 INFO L226 Difference]: Without dead ends: 9632 [2022-02-20 18:27:43,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:27:43,858 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 294 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:43,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 588 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2022-02-20 18:27:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 4960. [2022-02-20 18:27:46,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:46,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9632 states. Second operand has 4960 states, 4959 states have (on average 1.451703972575116) internal successors, (7199), 4959 states have internal predecessors, (7199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:46,372 INFO L74 IsIncluded]: Start isIncluded. First operand 9632 states. Second operand has 4960 states, 4959 states have (on average 1.451703972575116) internal successors, (7199), 4959 states have internal predecessors, (7199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:46,376 INFO L87 Difference]: Start difference. First operand 9632 states. Second operand has 4960 states, 4959 states have (on average 1.451703972575116) internal successors, (7199), 4959 states have internal predecessors, (7199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,859 INFO L93 Difference]: Finished difference Result 9632 states and 13983 transitions. [2022-02-20 18:27:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9632 states and 13983 transitions. [2022-02-20 18:27:48,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:48,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:48,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 4960 states, 4959 states have (on average 1.451703972575116) internal successors, (7199), 4959 states have internal predecessors, (7199), 0 states have call successors, (0), 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 9632 states. [2022-02-20 18:27:48,894 INFO L87 Difference]: Start difference. First operand has 4960 states, 4959 states have (on average 1.451703972575116) internal successors, (7199), 4959 states have internal predecessors, (7199), 0 states have call successors, (0), 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 9632 states. [2022-02-20 18:27:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:51,410 INFO L93 Difference]: Finished difference Result 9632 states and 13983 transitions. [2022-02-20 18:27:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 9632 states and 13983 transitions. [2022-02-20 18:27:51,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:51,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:51,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:51,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4960 states, 4959 states have (on average 1.451703972575116) internal successors, (7199), 4959 states have internal predecessors, (7199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4960 states to 4960 states and 7199 transitions. [2022-02-20 18:27:52,185 INFO L78 Accepts]: Start accepts. Automaton has 4960 states and 7199 transitions. Word has length 58 [2022-02-20 18:27:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:52,185 INFO L470 AbstractCegarLoop]: Abstraction has 4960 states and 7199 transitions. [2022-02-20 18:27:52,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4960 states and 7199 transitions. [2022-02-20 18:27:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:27:52,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:52,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:52,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:27:52,186 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash 581430488, now seen corresponding path program 1 times [2022-02-20 18:27:52,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:52,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80426032] [2022-02-20 18:27:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:52,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {78747#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {78747#true} is VALID [2022-02-20 18:27:52,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {78747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {78747#true} is VALID [2022-02-20 18:27:52,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {78747#true} assume 0 == ~r1~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {78749#(<= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {78749#(<= ~r1~0 0)} assume ~id1~0 >= 0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~st1~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {78749#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {78749#(<= ~r1~0 0)} assume ~id2~0 >= 0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~st2~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {78749#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {78749#(<= ~r1~0 0)} assume ~id3~0 >= 0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~st3~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {78749#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {78749#(<= ~r1~0 0)} assume ~id4~0 >= 0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~st4~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {78749#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {78749#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {78749#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {78749#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {78749#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {78749#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {78749#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {78749#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {78749#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {78749#(<= ~r1~0 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {78749#(<= ~r1~0 0)} ~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; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {78749#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {78749#(<= ~r1~0 0)} assume 0 != ~alive1~0 % 256; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {78749#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {78749#(<= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {78749#(<= ~r1~0 0)} ~mode1~0 := 1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {78749#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 != ~alive2~0 % 256); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {78749#(<= ~r1~0 0)} assume !(~send2~0 != ~id2~0); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {78749#(<= ~r1~0 0)} ~mode2~0 := 1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {78749#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 != ~alive3~0 % 256); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {78749#(<= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {78749#(<= ~r1~0 0)} ~mode3~0 := 1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {78749#(<= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {78749#(<= ~r1~0 0)} assume !(0 != ~alive4~0 % 256); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {78749#(<= ~r1~0 0)} assume !(~send4~0 != ~id4~0); {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {78749#(<= ~r1~0 0)} ~mode4~0 := 1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {78749#(<= ~r1~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; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {78749#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {78749#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:52,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {78749#(<= ~r1~0 0)} assume !(~r1~0 < 4); {78748#false} is VALID [2022-02-20 18:27:52,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {78748#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {78748#false} is VALID [2022-02-20 18:27:52,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {78748#false} check_#res#1 := check_~tmp~1#1; {78748#false} is VALID [2022-02-20 18:27:52,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {78748#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {78748#false} is VALID [2022-02-20 18:27:52,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {78748#false} assume 0 == assert_~arg#1 % 256; {78748#false} is VALID [2022-02-20 18:27:52,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {78748#false} assume !false; {78748#false} is VALID [2022-02-20 18:27:52,249 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:27:52,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:52,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80426032] [2022-02-20 18:27:52,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80426032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:52,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:52,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:52,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889721373] [2022-02-20 18:27:52,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:27:52,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:52,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:52,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:52,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:52,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:52,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:52,285 INFO L87 Difference]: Start difference. First operand 4960 states and 7199 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:00,109 INFO L93 Difference]: Finished difference Result 11966 states and 17395 transitions. [2022-02-20 18:28:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:28:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:28:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-02-20 18:28:00,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 334 transitions. [2022-02-20 18:28:00,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:02,132 INFO L225 Difference]: With dead ends: 11966 [2022-02-20 18:28:02,133 INFO L226 Difference]: Without dead ends: 7036 [2022-02-20 18:28:02,137 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:28:02,137 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 69 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:02,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2022-02-20 18:28:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 7034. [2022-02-20 18:28:05,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:05,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7036 states. Second operand has 7034 states, 7033 states have (on average 1.4458979098535476) internal successors, (10169), 7033 states have internal predecessors, (10169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:05,566 INFO L74 IsIncluded]: Start isIncluded. First operand 7036 states. Second operand has 7034 states, 7033 states have (on average 1.4458979098535476) internal successors, (10169), 7033 states have internal predecessors, (10169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:05,572 INFO L87 Difference]: Start difference. First operand 7036 states. Second operand has 7034 states, 7033 states have (on average 1.4458979098535476) internal successors, (10169), 7033 states have internal predecessors, (10169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:06,966 INFO L93 Difference]: Finished difference Result 7036 states and 10170 transitions. [2022-02-20 18:28:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7036 states and 10170 transitions. [2022-02-20 18:28:06,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:06,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:06,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 7034 states, 7033 states have (on average 1.4458979098535476) internal successors, (10169), 7033 states have internal predecessors, (10169), 0 states have call successors, (0), 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 7036 states. [2022-02-20 18:28:06,983 INFO L87 Difference]: Start difference. First operand has 7034 states, 7033 states have (on average 1.4458979098535476) internal successors, (10169), 7033 states have internal predecessors, (10169), 0 states have call successors, (0), 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 7036 states. [2022-02-20 18:28:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:08,420 INFO L93 Difference]: Finished difference Result 7036 states and 10170 transitions. [2022-02-20 18:28:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7036 states and 10170 transitions. [2022-02-20 18:28:08,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:08,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:08,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:08,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7034 states, 7033 states have (on average 1.4458979098535476) internal successors, (10169), 7033 states have internal predecessors, (10169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7034 states to 7034 states and 10169 transitions. [2022-02-20 18:28:10,096 INFO L78 Accepts]: Start accepts. Automaton has 7034 states and 10169 transitions. Word has length 59 [2022-02-20 18:28:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:10,097 INFO L470 AbstractCegarLoop]: Abstraction has 7034 states and 10169 transitions. [2022-02-20 18:28:10,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7034 states and 10169 transitions. [2022-02-20 18:28:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:28:10,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:10,100 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:10,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:28:10,100 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 418253800, now seen corresponding path program 1 times [2022-02-20 18:28:10,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:10,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895508749] [2022-02-20 18:28:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:10,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {115236#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {115236#true} is VALID [2022-02-20 18:28:10,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {115236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {115236#true} is VALID [2022-02-20 18:28:10,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {115236#true} assume 0 == ~r1~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 >= 0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 == ~id1~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode1~0 % 256; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 >= 0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st2~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 == ~id2~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode2~0 % 256; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 >= 0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st3~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 == ~id3~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode3~0 % 256; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id4~0 >= 0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st4~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send4~0 == ~id4~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode4~0 % 256; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id2~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id3~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id4~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id3~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id4~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} init_#res#1 := init_~tmp~0#1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == main_~i2~0#1); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~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; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode1~0 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != ~alive1~0 % 256; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 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; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode1~0 := 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode2~0 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive2~0 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send2~0 != ~id2~0); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode2~0 := 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode3~0 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive3~0 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send3~0 != ~id3~0); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode3~0 := 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode4~0 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive4~0 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send4~0 != ~id4~0); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode4~0 := 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 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; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} check_#res#1 := check_~tmp~1#1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == assert_~arg#1 % 256); {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:10,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {115238#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {115239#(<= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {115239#(<= ~r1~0 1)} ~mode1~0 := 0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {115239#(<= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,187 INFO L290 TraceCheckUtils]: 63: Hoare triple {115239#(<= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {115239#(<= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {115239#(<= ~r1~0 1)} ~mode2~0 := 0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,188 INFO L290 TraceCheckUtils]: 66: Hoare triple {115239#(<= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,188 INFO L290 TraceCheckUtils]: 67: Hoare triple {115239#(<= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,188 INFO L290 TraceCheckUtils]: 68: Hoare triple {115239#(<= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,188 INFO L290 TraceCheckUtils]: 69: Hoare triple {115239#(<= ~r1~0 1)} ~mode3~0 := 0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,189 INFO L290 TraceCheckUtils]: 70: Hoare triple {115239#(<= ~r1~0 1)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,189 INFO L290 TraceCheckUtils]: 71: Hoare triple {115239#(<= ~r1~0 1)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,189 INFO L290 TraceCheckUtils]: 72: Hoare triple {115239#(<= ~r1~0 1)} assume !(node4_~m4~0#1 != ~nomsg~0); {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {115239#(<= ~r1~0 1)} ~mode4~0 := 0; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,190 INFO L290 TraceCheckUtils]: 74: Hoare triple {115239#(<= ~r1~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; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,190 INFO L290 TraceCheckUtils]: 75: Hoare triple {115239#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {115239#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:10,190 INFO L290 TraceCheckUtils]: 76: Hoare triple {115239#(<= ~r1~0 1)} assume !(~r1~0 < 4); {115237#false} is VALID [2022-02-20 18:28:10,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {115237#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {115237#false} is VALID [2022-02-20 18:28:10,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {115237#false} check_#res#1 := check_~tmp~1#1; {115237#false} is VALID [2022-02-20 18:28:10,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {115237#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {115237#false} is VALID [2022-02-20 18:28:10,191 INFO L290 TraceCheckUtils]: 80: Hoare triple {115237#false} assume 0 == assert_~arg#1 % 256; {115237#false} is VALID [2022-02-20 18:28:10,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {115237#false} assume !false; {115237#false} is VALID [2022-02-20 18:28:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:28:10,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:10,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895508749] [2022-02-20 18:28:10,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895508749] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:28:10,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870663712] [2022-02-20 18:28:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:28:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:28:10,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:28:10,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:28:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:10,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 18:28:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:10,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:28:10,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {115236#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {115236#true} is VALID [2022-02-20 18:28:10,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {115236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {115236#true} is VALID [2022-02-20 18:28:10,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {115236#true} assume 0 == ~r1~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {115249#(= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {115249#(= ~r1~0 0)} assume ~id1~0 >= 0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~st1~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {115249#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {115249#(= ~r1~0 0)} assume ~id2~0 >= 0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~st2~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {115249#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {115249#(= ~r1~0 0)} assume ~id3~0 >= 0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~st3~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {115249#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {115249#(= ~r1~0 0)} assume ~id4~0 >= 0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~st4~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {115249#(= ~r1~0 0)} assume ~send4~0 == ~id4~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {115249#(= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {115249#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {115249#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {115249#(= ~r1~0 0)} assume ~id1~0 != ~id4~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {115249#(= ~r1~0 0)} assume ~id2~0 != ~id3~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {115249#(= ~r1~0 0)} assume ~id2~0 != ~id4~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {115249#(= ~r1~0 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {115249#(= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {115249#(= ~r1~0 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {115249#(= ~r1~0 0)} assume !(0 == main_~i2~0#1); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {115249#(= ~r1~0 0)} ~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; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {115249#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {115249#(= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {115249#(= ~r1~0 0)} assume 0 != ~alive1~0 % 256; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {115249#(= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {115249#(= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {115249#(= ~r1~0 0)} ~mode1~0 := 1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {115249#(= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {115249#(= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {115249#(= ~r1~0 0)} assume !(0 != ~alive2~0 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {115249#(= ~r1~0 0)} assume !(~send2~0 != ~id2~0); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {115249#(= ~r1~0 0)} ~mode2~0 := 1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {115249#(= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {115249#(= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {115249#(= ~r1~0 0)} assume !(0 != ~alive3~0 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {115249#(= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {115249#(= ~r1~0 0)} ~mode3~0 := 1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {115249#(= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {115249#(= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {115249#(= ~r1~0 0)} assume !(0 != ~alive4~0 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {115249#(= ~r1~0 0)} assume !(~send4~0 != ~id4~0); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {115249#(= ~r1~0 0)} ~mode4~0 := 1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {115249#(= ~r1~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; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {115249#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {115249#(= ~r1~0 0)} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {115403#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:28:10,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {115403#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} check_#res#1 := check_~tmp~1#1; {115407#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:28:10,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {115407#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {115249#(= ~r1~0 0)} assume !(0 == assert_~arg#1 % 256); {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {115249#(= ~r1~0 0)} assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {115249#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {115249#(= ~r1~0 0)} is VALID [2022-02-20 18:28:10,704 INFO L290 TraceCheckUtils]: 59: Hoare triple {115249#(= ~r1~0 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {115423#(= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {115423#(= ~r1~0 1)} ~mode1~0 := 0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {115423#(= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {115423#(= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,705 INFO L290 TraceCheckUtils]: 64: Hoare triple {115423#(= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {115423#(= ~r1~0 1)} ~mode2~0 := 0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,706 INFO L290 TraceCheckUtils]: 66: Hoare triple {115423#(= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {115423#(= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,706 INFO L290 TraceCheckUtils]: 68: Hoare triple {115423#(= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,706 INFO L290 TraceCheckUtils]: 69: Hoare triple {115423#(= ~r1~0 1)} ~mode3~0 := 0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,707 INFO L290 TraceCheckUtils]: 70: Hoare triple {115423#(= ~r1~0 1)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,707 INFO L290 TraceCheckUtils]: 71: Hoare triple {115423#(= ~r1~0 1)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,707 INFO L290 TraceCheckUtils]: 72: Hoare triple {115423#(= ~r1~0 1)} assume !(node4_~m4~0#1 != ~nomsg~0); {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,707 INFO L290 TraceCheckUtils]: 73: Hoare triple {115423#(= ~r1~0 1)} ~mode4~0 := 0; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,708 INFO L290 TraceCheckUtils]: 74: Hoare triple {115423#(= ~r1~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; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,708 INFO L290 TraceCheckUtils]: 75: Hoare triple {115423#(= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {115423#(= ~r1~0 1)} is VALID [2022-02-20 18:28:10,708 INFO L290 TraceCheckUtils]: 76: Hoare triple {115423#(= ~r1~0 1)} assume !(~r1~0 < 4); {115237#false} is VALID [2022-02-20 18:28:10,708 INFO L290 TraceCheckUtils]: 77: Hoare triple {115237#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {115237#false} is VALID [2022-02-20 18:28:10,708 INFO L290 TraceCheckUtils]: 78: Hoare triple {115237#false} check_#res#1 := check_~tmp~1#1; {115237#false} is VALID [2022-02-20 18:28:10,708 INFO L290 TraceCheckUtils]: 79: Hoare triple {115237#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {115237#false} is VALID [2022-02-20 18:28:10,708 INFO L290 TraceCheckUtils]: 80: Hoare triple {115237#false} assume 0 == assert_~arg#1 % 256; {115237#false} is VALID [2022-02-20 18:28:10,709 INFO L290 TraceCheckUtils]: 81: Hoare triple {115237#false} assume !false; {115237#false} is VALID [2022-02-20 18:28:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:28:10,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:28:11,311 INFO L290 TraceCheckUtils]: 81: Hoare triple {115237#false} assume !false; {115237#false} is VALID [2022-02-20 18:28:11,311 INFO L290 TraceCheckUtils]: 80: Hoare triple {115237#false} assume 0 == assert_~arg#1 % 256; {115237#false} is VALID [2022-02-20 18:28:11,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {115237#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {115237#false} is VALID [2022-02-20 18:28:11,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {115237#false} check_#res#1 := check_~tmp~1#1; {115237#false} is VALID [2022-02-20 18:28:11,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {115237#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {115237#false} is VALID [2022-02-20 18:28:11,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {115505#(< ~r1~0 4)} assume !(~r1~0 < 4); {115237#false} is VALID [2022-02-20 18:28:11,312 INFO L290 TraceCheckUtils]: 75: Hoare triple {115505#(< ~r1~0 4)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,313 INFO L290 TraceCheckUtils]: 74: Hoare triple {115505#(< ~r1~0 4)} 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; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,313 INFO L290 TraceCheckUtils]: 73: Hoare triple {115505#(< ~r1~0 4)} ~mode4~0 := 0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,313 INFO L290 TraceCheckUtils]: 72: Hoare triple {115505#(< ~r1~0 4)} assume !(node4_~m4~0#1 != ~nomsg~0); {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,313 INFO L290 TraceCheckUtils]: 71: Hoare triple {115505#(< ~r1~0 4)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {115505#(< ~r1~0 4)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {115505#(< ~r1~0 4)} ~mode3~0 := 0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {115505#(< ~r1~0 4)} assume !(node3_~m3~0#1 != ~nomsg~0); {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {115505#(< ~r1~0 4)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {115505#(< ~r1~0 4)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {115505#(< ~r1~0 4)} ~mode2~0 := 0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,315 INFO L290 TraceCheckUtils]: 64: Hoare triple {115505#(< ~r1~0 4)} assume !(node2_~m2~0#1 != ~nomsg~0); {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,315 INFO L290 TraceCheckUtils]: 63: Hoare triple {115505#(< ~r1~0 4)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {115505#(< ~r1~0 4)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {115505#(< ~r1~0 4)} ~mode1~0 := 0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {115505#(< ~r1~0 4)} assume !(node1_~m1~0#1 != ~nomsg~0); {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {115505#(< ~r1~0 4)} is VALID [2022-02-20 18:28:11,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 == assert_~arg#1 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#1 <= 2147483647;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#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; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} check_#res#1 := check_~tmp~1#1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} 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; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode4~0 := 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(~send4~0 != ~id4~0); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~alive4~0 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode4~0 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode3~0 := 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(~send3~0 != ~id3~0); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~alive3~0 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode3~0 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode2~0 := 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(~send2~0 != ~id2~0); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~alive2~0 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode2~0 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode1~0 := 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~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; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 != ~alive1~0 % 256; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode1~0 % 256); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~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; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 == main_~i2~0#1); {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} init_#res#1 := init_~tmp~0#1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id2~0 != ~id4~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id2~0 != ~id3~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 != ~id4~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 != ~id3~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 != ~id2~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode4~0 % 256; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send4~0 == ~id4~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st4~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id4~0 >= 0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode3~0 % 256; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send3~0 == ~id3~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st3~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id3~0 >= 0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode2~0 % 256; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send2~0 == ~id2~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st2~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id2~0 >= 0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode1~0 % 256; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send1~0 == ~id1~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st1~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 >= 0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {115236#true} assume 0 == ~r1~0; {115557#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:11,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {115236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {115236#true} is VALID [2022-02-20 18:28:11,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {115236#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(49, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {115236#true} is VALID [2022-02-20 18:28:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:28:11,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870663712] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:28:11,341 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:28:11,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 10 [2022-02-20 18:28:11,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302904760] [2022-02-20 18:28:11,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:28:11,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-20 18:28:11,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:11,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:11,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:11,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:28:11,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:28:11,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:28:11,486 INFO L87 Difference]: Start difference. First operand 7034 states and 10169 transitions. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)